/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/Problem10_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 01:48:46,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 01:48:46,784 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-16 01:48:46,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 01:48:46,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 01:48:46,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 01:48:46,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 01:48:46,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 01:48:46,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 01:48:46,869 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 01:48:46,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 01:48:46,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 01:48:46,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 01:48:46,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 01:48:46,872 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 01:48:46,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 01:48:46,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 01:48:46,872 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 01:48:46,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 01:48:46,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 01:48:46,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 01:48:46,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 01:48:46,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 01:48:46,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 01:48:46,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 01:48:46,874 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 01:48:46,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 01:48:46,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 01:48:46,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 01:48:46,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 01:48:46,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 01:48:46,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 01:48:46,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:48:46,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 01:48:46,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 01:48:46,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 01:48:46,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 01:48:46,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 01:48:46,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 01:48:46,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 01:48:46,878 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 01:48:46,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 01:48:46,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 01:48:46,879 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-16 01:48:47,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 01:48:47,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 01:48:47,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 01:48:47,324 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 01:48:47,324 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 01:48:47,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2023-12-16 01:48:48,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 01:48:48,905 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 01:48:48,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2023-12-16 01:48:48,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd3a0d5d/8bbfacf923034c2189dc2258e73d31d6/FLAG9f7b4836e [2023-12-16 01:48:48,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd3a0d5d/8bbfacf923034c2189dc2258e73d31d6 [2023-12-16 01:48:48,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 01:48:48,945 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 01:48:48,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 01:48:48,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 01:48:48,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 01:48:48,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100620d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48, skipping insertion in model container [2023-12-16 01:48:48,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:49,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 01:48:49,238 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/Problem10_label28.c[1526,1539] [2023-12-16 01:48:49,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:48:49,478 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 01:48:49,499 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/Problem10_label28.c[1526,1539] [2023-12-16 01:48:49,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:48:49,609 INFO L206 MainTranslator]: Completed translation [2023-12-16 01:48:49,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49 WrapperNode [2023-12-16 01:48:49,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 01:48:49,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 01:48:49,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 01:48:49,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 01:48:49,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,730 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2023-12-16 01:48:49,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 01:48:49,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 01:48:49,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 01:48:49,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 01:48:49,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,790 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-16 01:48:49,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 01:48:49,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 01:48:49,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 01:48:49,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 01:48:49,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (1/1) ... [2023-12-16 01:48:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:48:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:48:49,902 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-16 01:48:49,928 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-16 01:48:49,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 01:48:49,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 01:48:49,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 01:48:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 01:48:49,997 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 01:48:49,999 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 01:48:51,071 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 01:48:51,134 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 01:48:51,134 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 01:48:51,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:48:51 BoogieIcfgContainer [2023-12-16 01:48:51,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 01:48:51,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 01:48:51,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 01:48:51,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 01:48:51,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:48:48" (1/3) ... [2023-12-16 01:48:51,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be15c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:48:51, skipping insertion in model container [2023-12-16 01:48:51,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:49" (2/3) ... [2023-12-16 01:48:51,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be15c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:48:51, skipping insertion in model container [2023-12-16 01:48:51,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:48:51" (3/3) ... [2023-12-16 01:48:51,144 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2023-12-16 01:48:51,160 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 01:48:51,161 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 01:48:51,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 01:48:51,233 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;@2237465d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 01:48:51,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 01:48:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 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-16 01:48:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 01:48:51,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:51,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:51,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:51,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1682269004, now seen corresponding path program 1 times [2023-12-16 01:48:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:51,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124668270] [2023-12-16 01:48:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:51,427 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-16 01:48:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124668270] [2023-12-16 01:48:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124668270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277560206] [2023-12-16 01:48:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 01:48:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 01:48:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 01:48:51,478 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 01:48:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:51,533 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2023-12-16 01:48:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 01:48:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 01:48:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:51,546 INFO L225 Difference]: With dead ends: 287 [2023-12-16 01:48:51,547 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 01:48:51,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 01:48:51,553 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:51,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:48:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 01:48:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-12-16 01:48:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 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-16 01:48:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2023-12-16 01:48:51,590 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 10 [2023-12-16 01:48:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:51,591 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2023-12-16 01:48:51,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 01:48:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2023-12-16 01:48:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 01:48:51,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:51,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:51,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 01:48:51,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:51,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1145130230, now seen corresponding path program 1 times [2023-12-16 01:48:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993106078] [2023-12-16 01:48:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:51,699 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-16 01:48:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993106078] [2023-12-16 01:48:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993106078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518945442] [2023-12-16 01:48:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:51,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:51,708 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 01:48:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:52,381 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2023-12-16 01:48:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 01:48:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:52,384 INFO L225 Difference]: With dead ends: 283 [2023-12-16 01:48:52,384 INFO L226 Difference]: Without dead ends: 281 [2023-12-16 01:48:52,384 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-16 01:48:52,385 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 173 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:52,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 01:48:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-16 01:48:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-12-16 01:48:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 0 states have call successors, (0), 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-16 01:48:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2023-12-16 01:48:52,407 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 10 [2023-12-16 01:48:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:52,413 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2023-12-16 01:48:52,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 01:48:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2023-12-16 01:48:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 01:48:52,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:52,416 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] [2023-12-16 01:48:52,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 01:48:52,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:52,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1892634588, now seen corresponding path program 1 times [2023-12-16 01:48:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957769234] [2023-12-16 01:48:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:52,824 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-16 01:48:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957769234] [2023-12-16 01:48:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957769234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:52,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:52,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924191855] [2023-12-16 01:48:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:52,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:52,835 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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-16 01:48:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:53,308 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2023-12-16 01:48:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-16 01:48:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:53,311 INFO L225 Difference]: With dead ends: 700 [2023-12-16 01:48:53,311 INFO L226 Difference]: Without dead ends: 420 [2023-12-16 01:48:53,313 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-16 01:48:53,313 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:53,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-12-16 01:48:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2023-12-16 01:48:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 0 states have call successors, (0), 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-16 01:48:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2023-12-16 01:48:53,344 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 79 [2023-12-16 01:48:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:53,348 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2023-12-16 01:48:53,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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-16 01:48:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2023-12-16 01:48:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 01:48:53,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:53,353 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] [2023-12-16 01:48:53,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 01:48:53,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:53,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1132990227, now seen corresponding path program 1 times [2023-12-16 01:48:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:53,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666000805] [2023-12-16 01:48:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:53,477 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-16 01:48:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:53,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666000805] [2023-12-16 01:48:53,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666000805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:53,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489328735] [2023-12-16 01:48:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:53,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:53,480 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 01:48:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:54,020 INFO L93 Difference]: Finished difference Result 561 states and 821 transitions. [2023-12-16 01:48:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2023-12-16 01:48:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:54,023 INFO L225 Difference]: With dead ends: 561 [2023-12-16 01:48:54,023 INFO L226 Difference]: Without dead ends: 559 [2023-12-16 01:48:54,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-16 01:48:54,024 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:54,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-12-16 01:48:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2023-12-16 01:48:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 0 states have call successors, (0), 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-16 01:48:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2023-12-16 01:48:54,037 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 85 [2023-12-16 01:48:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:54,038 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2023-12-16 01:48:54,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 01:48:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2023-12-16 01:48:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 01:48:54,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:54,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:54,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 01:48:54,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:54,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 305937039, now seen corresponding path program 1 times [2023-12-16 01:48:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317068534] [2023-12-16 01:48:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:54,155 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-16 01:48:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:54,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317068534] [2023-12-16 01:48:54,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317068534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:54,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:54,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383747823] [2023-12-16 01:48:54,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:54,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:54,158 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:54,646 INFO L93 Difference]: Finished difference Result 1117 states and 1638 transitions. [2023-12-16 01:48:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-16 01:48:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:54,650 INFO L225 Difference]: With dead ends: 1117 [2023-12-16 01:48:54,650 INFO L226 Difference]: Without dead ends: 698 [2023-12-16 01:48:54,651 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-16 01:48:54,652 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:54,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2023-12-16 01:48:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2023-12-16 01:48:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3243727598566308) internal successors, (739), 558 states have internal predecessors, (739), 0 states have call successors, (0), 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-16 01:48:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 739 transitions. [2023-12-16 01:48:54,664 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 739 transitions. Word has length 104 [2023-12-16 01:48:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:54,665 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 739 transitions. [2023-12-16 01:48:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 739 transitions. [2023-12-16 01:48:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 01:48:54,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:54,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 01:48:54,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 01:48:54,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:54,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 432756939, now seen corresponding path program 1 times [2023-12-16 01:48:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706172729] [2023-12-16 01:48:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:54,985 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-16 01:48:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706172729] [2023-12-16 01:48:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706172729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992290860] [2023-12-16 01:48:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 01:48:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 01:48:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 01:48:54,989 INFO L87 Difference]: Start difference. First operand 559 states and 739 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 01:48:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:55,577 INFO L93 Difference]: Finished difference Result 981 states and 1331 transitions. [2023-12-16 01:48:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 01:48:55,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2023-12-16 01:48:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:55,580 INFO L225 Difference]: With dead ends: 981 [2023-12-16 01:48:55,580 INFO L226 Difference]: Without dead ends: 562 [2023-12-16 01:48:55,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 01:48:55,582 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:55,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 83 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-16 01:48:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2023-12-16 01:48:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 0 states have call successors, (0), 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-16 01:48:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2023-12-16 01:48:55,593 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 128 [2023-12-16 01:48:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:55,594 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2023-12-16 01:48:55,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 01:48:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2023-12-16 01:48:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-16 01:48:55,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:55,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:55,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 01:48:55,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:55,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash 309699450, now seen corresponding path program 1 times [2023-12-16 01:48:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090694790] [2023-12-16 01:48:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090694790] [2023-12-16 01:48:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090694790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:55,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858365307] [2023-12-16 01:48:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:55,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:55,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:55,839 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-16 01:48:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:56,681 INFO L93 Difference]: Finished difference Result 1256 states and 1752 transitions. [2023-12-16 01:48:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:56,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2023-12-16 01:48:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:56,685 INFO L225 Difference]: With dead ends: 1256 [2023-12-16 01:48:56,685 INFO L226 Difference]: Without dead ends: 837 [2023-12-16 01:48:56,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 01:48:56,687 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:56,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 01:48:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-12-16 01:48:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2023-12-16 01:48:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3672248803827751) internal successors, (1143), 836 states have internal predecessors, (1143), 0 states have call successors, (0), 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-16 01:48:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1143 transitions. [2023-12-16 01:48:56,722 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1143 transitions. Word has length 154 [2023-12-16 01:48:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:56,722 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 1143 transitions. [2023-12-16 01:48:56,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-16 01:48:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1143 transitions. [2023-12-16 01:48:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-16 01:48:56,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:56,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 01:48:56,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 01:48:56,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:56,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1498287710, now seen corresponding path program 1 times [2023-12-16 01:48:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213192712] [2023-12-16 01:48:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213192712] [2023-12-16 01:48:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213192712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643439660] [2023-12-16 01:48:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:56,876 INFO L87 Difference]: Start difference. First operand 837 states and 1143 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 01:48:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:57,283 INFO L93 Difference]: Finished difference Result 1812 states and 2550 transitions. [2023-12-16 01:48:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2023-12-16 01:48:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:57,288 INFO L225 Difference]: With dead ends: 1812 [2023-12-16 01:48:57,288 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:48:57,289 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-16 01:48:57,290 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:57,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 210 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:48:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:48:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:48:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2944344703770196) internal successors, (1442), 1114 states have internal predecessors, (1442), 0 states have call successors, (0), 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-16 01:48:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1442 transitions. [2023-12-16 01:48:57,312 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1442 transitions. Word has length 170 [2023-12-16 01:48:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:57,312 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1442 transitions. [2023-12-16 01:48:57,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 01:48:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1442 transitions. [2023-12-16 01:48:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-16 01:48:57,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:57,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 01:48:57,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 01:48:57,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:57,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash 799589356, now seen corresponding path program 1 times [2023-12-16 01:48:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:57,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694102132] [2023-12-16 01:48:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:57,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:57,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694102132] [2023-12-16 01:48:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694102132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 01:48:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423038430] [2023-12-16 01:48:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:57,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 01:48:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 01:48:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:57,713 INFO L87 Difference]: Start difference. First operand 1115 states and 1442 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-16 01:48:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:58,288 INFO L93 Difference]: Finished difference Result 2145 states and 2794 transitions. [2023-12-16 01:48:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 01:48:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2023-12-16 01:48:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:58,293 INFO L225 Difference]: With dead ends: 2145 [2023-12-16 01:48:58,293 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:48:58,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:58,295 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:58,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:48:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:48:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.289048473967684) internal successors, (1436), 1114 states have internal predecessors, (1436), 0 states have call successors, (0), 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-16 01:48:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1436 transitions. [2023-12-16 01:48:58,313 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1436 transitions. Word has length 179 [2023-12-16 01:48:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:58,314 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1436 transitions. [2023-12-16 01:48:58,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-16 01:48:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1436 transitions. [2023-12-16 01:48:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-16 01:48:58,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:58,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:58,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 01:48:58,317 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:58,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1491177478, now seen corresponding path program 1 times [2023-12-16 01:48:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944169934] [2023-12-16 01:48:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944169934] [2023-12-16 01:48:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944169934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594266049] [2023-12-16 01:48:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:58,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:58,702 INFO L87 Difference]: Start difference. First operand 1115 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-16 01:48:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:59,203 INFO L93 Difference]: Finished difference Result 2368 states and 3135 transitions. [2023-12-16 01:48:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2023-12-16 01:48:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:59,209 INFO L225 Difference]: With dead ends: 2368 [2023-12-16 01:48:59,209 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:48:59,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 01:48:59,211 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:59,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 13 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:48:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2023-12-16 01:48:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.3096264367816093) internal successors, (1823), 1392 states have internal predecessors, (1823), 0 states have call successors, (0), 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-16 01:48:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1823 transitions. [2023-12-16 01:48:59,257 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1823 transitions. Word has length 215 [2023-12-16 01:48:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:59,258 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1823 transitions. [2023-12-16 01:48:59,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-16 01:48:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1823 transitions. [2023-12-16 01:48:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-12-16 01:48:59,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:59,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:59,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 01:48:59,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:59,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1156528864, now seen corresponding path program 1 times [2023-12-16 01:48:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546103973] [2023-12-16 01:48:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-16 01:48:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546103973] [2023-12-16 01:48:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546103973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755612535] [2023-12-16 01:48:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:59,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:59,496 INFO L87 Difference]: Start difference. First operand 1393 states and 1823 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 01:49:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:49:00,003 INFO L93 Difference]: Finished difference Result 2785 states and 3660 transitions. [2023-12-16 01:49:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:49:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 236 [2023-12-16 01:49:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:49:00,008 INFO L225 Difference]: With dead ends: 2785 [2023-12-16 01:49:00,008 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:49:00,010 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-16 01:49:00,011 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:49:00,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 222 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:49:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:49:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:49:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2549371633752244) internal successors, (1398), 1114 states have internal predecessors, (1398), 0 states have call successors, (0), 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-16 01:49:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1398 transitions. [2023-12-16 01:49:00,029 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1398 transitions. Word has length 236 [2023-12-16 01:49:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:49:00,029 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1398 transitions. [2023-12-16 01:49:00,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 01:49:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1398 transitions. [2023-12-16 01:49:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-16 01:49:00,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:49:00,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:49:00,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 01:49:00,033 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:49:00,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:49:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash -434060675, now seen corresponding path program 1 times [2023-12-16 01:49:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:49:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55890300] [2023-12-16 01:49:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:49:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:49:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:49:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:49:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55890300] [2023-12-16 01:49:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55890300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 01:49:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487885923] [2023-12-16 01:49:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 01:49:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:49:00,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 01:49:00,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 01:49:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:49:00,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 01:49:00,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 01:49:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-16 01:49:00,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 01:49:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487885923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:49:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 01:49:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-16 01:49:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090469921] [2023-12-16 01:49:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:49:00,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:49:00,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:49:00,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:49:00,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:49:00,917 INFO L87 Difference]: Start difference. First operand 1115 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 01:49:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:49:01,349 INFO L93 Difference]: Finished difference Result 2368 states and 3005 transitions. [2023-12-16 01:49:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:49:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 237 [2023-12-16 01:49:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:49:01,356 INFO L225 Difference]: With dead ends: 2368 [2023-12-16 01:49:01,357 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:49:01,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:49:01,359 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:49:01,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:49:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:49:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2023-12-16 01:49:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1846264367816093) internal successors, (1649), 1392 states have internal predecessors, (1649), 0 states have call successors, (0), 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-16 01:49:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1649 transitions. [2023-12-16 01:49:01,389 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1649 transitions. Word has length 237 [2023-12-16 01:49:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:49:01,390 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1649 transitions. [2023-12-16 01:49:01,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 01:49:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1649 transitions. [2023-12-16 01:49:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2023-12-16 01:49:01,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:49:01,394 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 01:49:01,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 01:49:01,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 01:49:01,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:49:01,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:49:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1106806655, now seen corresponding path program 1 times [2023-12-16 01:49:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:49:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503149417] [2023-12-16 01:49:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:49:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:49:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-12-16 01:49:01,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:49:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503149417] [2023-12-16 01:49:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503149417] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:49:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:49:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:49:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821975561] [2023-12-16 01:49:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:49:01,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:49:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:49:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:49:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:49:01,899 INFO L87 Difference]: Start difference. First operand 1393 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:49:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:49:02,423 INFO L93 Difference]: Finished difference Result 2646 states and 3154 transitions. [2023-12-16 01:49:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:49:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2023-12-16 01:49:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:49:02,428 INFO L225 Difference]: With dead ends: 2646 [2023-12-16 01:49:02,429 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:49:02,430 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-16 01:49:02,431 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:49:02,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 186 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:49:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:49:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2023-12-16 01:49:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1452513966480447) internal successors, (1435), 1253 states have internal predecessors, (1435), 0 states have call successors, (0), 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-16 01:49:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1435 transitions. [2023-12-16 01:49:02,455 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1435 transitions. Word has length 282 [2023-12-16 01:49:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:49:02,456 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1435 transitions. [2023-12-16 01:49:02,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:49:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1435 transitions. [2023-12-16 01:49:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2023-12-16 01:49:02,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:49:02,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-12-16 01:49:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 01:49:02,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:49:02,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:49:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 37255024, now seen corresponding path program 1 times [2023-12-16 01:49:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:49:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785118390] [2023-12-16 01:49:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:49:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:49:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-12-16 01:49:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:49:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785118390] [2023-12-16 01:49:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785118390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:49:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:49:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:49:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64443248] [2023-12-16 01:49:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:49:02,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:49:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:49:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:49:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:49:02,796 INFO L87 Difference]: Start difference. First operand 1254 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:49:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:49:03,435 INFO L93 Difference]: Finished difference Result 3341 states and 3858 transitions. [2023-12-16 01:49:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:49:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2023-12-16 01:49:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:49:03,443 INFO L225 Difference]: With dead ends: 3341 [2023-12-16 01:49:03,443 INFO L226 Difference]: Without dead ends: 2227 [2023-12-16 01:49:03,445 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-16 01:49:03,446 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 01:49:03,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 190 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 01:49:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2023-12-16 01:49:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1810. [2023-12-16 01:49:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.1586511885019348) internal successors, (2096), 1809 states have internal predecessors, (2096), 0 states have call successors, (0), 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-16 01:49:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2096 transitions. [2023-12-16 01:49:03,481 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2096 transitions. Word has length 288 [2023-12-16 01:49:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:49:03,482 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 2096 transitions. [2023-12-16 01:49:03,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:49:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2096 transitions. [2023-12-16 01:49:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 01:49:03,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:49:03,486 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 01:49:03,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 01:49:03,487 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:49:03,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:49:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1801101781, now seen corresponding path program 1 times [2023-12-16 01:49:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:49:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062366677] [2023-12-16 01:49:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:49:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:49:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-16 01:49:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:49:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062366677] [2023-12-16 01:49:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062366677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:49:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:49:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:49:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458799606] [2023-12-16 01:49:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:49:03,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:49:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:49:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:49:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:49:03,632 INFO L87 Difference]: Start difference. First operand 1810 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 01:49:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:49:04,250 INFO L93 Difference]: Finished difference Result 4314 states and 5011 transitions. [2023-12-16 01:49:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:49:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 305 [2023-12-16 01:49:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:49:04,259 INFO L225 Difference]: With dead ends: 4314 [2023-12-16 01:49:04,259 INFO L226 Difference]: Without dead ends: 2644 [2023-12-16 01:49:04,262 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-16 01:49:04,263 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 01:49:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 199 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 01:49:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2023-12-16 01:49:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2023-12-16 01:49:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.1399924328414681) internal successors, (3013), 2643 states have internal predecessors, (3013), 0 states have call successors, (0), 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-16 01:49:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3013 transitions. [2023-12-16 01:49:04,323 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3013 transitions. Word has length 305 [2023-12-16 01:49:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:49:04,323 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3013 transitions. [2023-12-16 01:49:04,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 01:49:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3013 transitions. [2023-12-16 01:49:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-12-16 01:49:04,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:49:04,330 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 01:49:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 01:49:04,330 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:49:04,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:49:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1660205563, now seen corresponding path program 1 times [2023-12-16 01:49:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:49:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954115955] [2023-12-16 01:49:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:49:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:49:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:49:04,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 01:49:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:49:04,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 01:49:04,554 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 01:49:04,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 01:49:04,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 01:49:04,559 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:49:04,565 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 01:49:04,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:49:04 BoogieIcfgContainer [2023-12-16 01:49:04,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 01:49:04,691 INFO L158 Benchmark]: Toolchain (without parser) took 15746.08ms. Allocated memory was 316.7MB in the beginning and 457.2MB in the end (delta: 140.5MB). Free memory was 264.4MB in the beginning and 178.5MB in the end (delta: 85.9MB). Peak memory consumption was 227.3MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,691 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 207.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:49:04,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.54ms. Allocated memory is still 316.7MB. Free memory was 264.2MB in the beginning and 236.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.36ms. Allocated memory is still 316.7MB. Free memory was 236.0MB in the beginning and 227.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,693 INFO L158 Benchmark]: Boogie Preprocessor took 131.19ms. Allocated memory is still 316.7MB. Free memory was 227.7MB in the beginning and 279.1MB in the end (delta: -51.3MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,693 INFO L158 Benchmark]: RCFGBuilder took 1271.76ms. Allocated memory is still 316.7MB. Free memory was 279.1MB in the beginning and 189.4MB in the end (delta: 89.7MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,693 INFO L158 Benchmark]: TraceAbstraction took 13553.73ms. Allocated memory was 316.7MB in the beginning and 457.2MB in the end (delta: 140.5MB). Free memory was 188.9MB in the beginning and 178.5MB in the end (delta: 10.4MB). Peak memory consumption was 150.9MB. Max. memory is 8.0GB. [2023-12-16 01:49:04,697 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.11ms. Allocated memory is still 255.9MB. Free memory is still 207.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 664.54ms. Allocated memory is still 316.7MB. Free memory was 264.2MB in the beginning and 236.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 119.36ms. Allocated memory is still 316.7MB. Free memory was 236.0MB in the beginning and 227.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 131.19ms. Allocated memory is still 316.7MB. Free memory was 227.7MB in the beginning and 279.1MB in the end (delta: -51.3MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * RCFGBuilder took 1271.76ms. Allocated memory is still 316.7MB. Free memory was 279.1MB in the beginning and 189.4MB in the end (delta: 89.7MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. * TraceAbstraction took 13553.73ms. Allocated memory was 316.7MB in the beginning and 457.2MB in the end (delta: 140.5MB). Free memory was 188.9MB in the beginning and 178.5MB in the end (delta: 10.4MB). Peak memory consumption was 150.9MB. 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: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; [L589] int output = -1; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [\old(input)=3, \result=25, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=2, a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L297] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L298] a19 = 10 [L300] return 25; VAL [\old(input)=2, \result=25, a10=1, a12=0, a19=10, a1=132, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L465] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L466] a10 = 2 [L467] a19 = 7 [L469] return -1; VAL [\old(input)=5, \result=-1, a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] reach_error() VAL [\old(input)=6, a10=2, a12=0, a19=7, a1=2, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1409 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1409 mSDsluCounter, 1535 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 908 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5746 IncrementalHoareTripleChecker+Invalid, 6654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 908 mSolverCounterUnsat, 1466 mSDtfsCounter, 5746 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2644occurred in iteration=15, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 837 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3037 NumberOfCodeBlocks, 3037 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2703 ConstructedInterpolants, 0 QuantifiedInterpolants, 8670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 1481/1576 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-16 01:49:04,719 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...