/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:54:39,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:54:39,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-02 19:54:39,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:54:39,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:54:40,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:54:40,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:54:40,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:54:40,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:54:40,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:54:40,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:54:40,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:54:40,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:54:40,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:54:40,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:54:40,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:54:40,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:54:40,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:54:40,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:54:40,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:54:40,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:54:40,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:54:40,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:54:40,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:54:40,032 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:54:40,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:54:40,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:54:40,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:54:40,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:54:40,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:54:40,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:54:40,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:54:40,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:54:40,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:54:40,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:40,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:54:40,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:54:40,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:54:40,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:54:40,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:54:40,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:54:40,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:54:40,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:54:40,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:54:40,036 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol [2024-11-02 19:54:40,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:54:40,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:54:40,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:54:40,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:54:40,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:54:40,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i [2024-11-02 19:54:41,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:54:41,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:54:41,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i [2024-11-02 19:54:41,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284aee3cd/45e6c8df87ae47db9204352926cf4fe4/FLAG9bd90fc9b [2024-11-02 19:54:41,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284aee3cd/45e6c8df87ae47db9204352926cf4fe4 [2024-11-02 19:54:41,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:54:41,856 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:54:41,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:41,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:54:41,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:54:41,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:41" (1/1) ... [2024-11-02 19:54:41,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ceeccad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:41, skipping insertion in model container [2024-11-02 19:54:41,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:41" (1/1) ... [2024-11-02 19:54:41,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:54:42,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i[1168,1181] [2024-11-02 19:54:42,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:42,050 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:54:42,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i[1168,1181] [2024-11-02 19:54:42,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:42,090 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:54:42,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42 WrapperNode [2024-11-02 19:54:42,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:42,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:42,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:54:42,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:54:42,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,123 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-02 19:54:42,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:42,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:54:42,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:54:42,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:54:42,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,151 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-02 19:54:42,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:54:42,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:54:42,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:54:42,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:54:42,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (1/1) ... [2024-11-02 19:54:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:42,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:54:42,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-02 19:54:42,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-02 19:54:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:54:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:54:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:54:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:54:42,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:54:42,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:54:42,584 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-02 19:54:42,584 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:54:42,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:54:42,595 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 19:54:42,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:42 BoogieIcfgContainer [2024-11-02 19:54:42,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:54:42,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:54:42,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:54:42,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:54:42,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:54:41" (1/3) ... [2024-11-02 19:54:42,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b17f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:42, skipping insertion in model container [2024-11-02 19:54:42,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:42" (2/3) ... [2024-11-02 19:54:42,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b17f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:42, skipping insertion in model container [2024-11-02 19:54:42,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:42" (3/3) ... [2024-11-02 19:54:42,603 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-11-02 19:54:42,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:54:42,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:54:42,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:54:42,692 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4735a4d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:54:42,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:54:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:42,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:42,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:42,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-02 19:54:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45497977] [2024-11-02 19:54:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:42,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-02 19:54:42,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:42,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:42,944 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45497977] [2024-11-02 19:54:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [45497977] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:42,947 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-02 19:54:42,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246978530] [2024-11-02 19:54:42,950 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:42,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 19:54:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 19:54:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:42,979 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:42,996 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-02 19:54:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 19:54:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-02 19:54:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:43,005 INFO L225 Difference]: With dead ends: 57 [2024-11-02 19:54:43,005 INFO L226 Difference]: Without dead ends: 38 [2024-11-02 19:54:43,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:43,014 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:43,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-02 19:54:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-02 19:54:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-02 19:54:43,051 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-02 19:54:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:43,052 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-02 19:54:43,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-02 19:54:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:43,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:43,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:43,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:54:43,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:43,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-02 19:54:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468834960] [2024-11-02 19:54:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:43,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:54:43,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:43,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:43,806 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468834960] [2024-11-02 19:54:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [468834960] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:43,807 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328576467] [2024-11-02 19:54:43,813 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:43,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:43,815 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:44,101 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-11-02 19:54:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 12 [2024-11-02 19:54:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:44,102 INFO L225 Difference]: With dead ends: 107 [2024-11-02 19:54:44,102 INFO L226 Difference]: Without dead ends: 79 [2024-11-02 19:54:44,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:44,103 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 60 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:44,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 61 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-02 19:54:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2024-11-02 19:54:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 62 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-02 19:54:44,120 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 12 [2024-11-02 19:54:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-02 19:54:44,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-02 19:54:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:44,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:44,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:44,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:54:44,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:44,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -235076041, now seen corresponding path program 1 times [2024-11-02 19:54:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495254809] [2024-11-02 19:54:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:44,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:44,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:54:44,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:54:44,509 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495254809] [2024-11-02 19:54:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [495254809] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:44,509 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2024-11-02 19:54:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124805129] [2024-11-02 19:54:44,510 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 19:54:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 19:54:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:54:44,513 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:44,830 INFO L93 Difference]: Finished difference Result 150 states and 239 transitions. [2024-11-02 19:54:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 19:54:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 24 [2024-11-02 19:54:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:44,834 INFO L225 Difference]: With dead ends: 150 [2024-11-02 19:54:44,834 INFO L226 Difference]: Without dead ends: 102 [2024-11-02 19:54:44,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:54:44,836 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:44,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 70 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-02 19:54:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-02 19:54:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 97 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2024-11-02 19:54:44,854 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 24 [2024-11-02 19:54:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2024-11-02 19:54:44,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2024-11-02 19:54:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:44,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:44,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:54:44,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 730584695, now seen corresponding path program 1 times [2024-11-02 19:54:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226147606] [2024-11-02 19:54:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:45,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:45,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:45,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:45,251 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226147606] [2024-11-02 19:54:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1226147606] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:45,251 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:45,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-11-02 19:54:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865991074] [2024-11-02 19:54:45,251 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:54:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:45,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:54:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:54:45,252 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:45,648 INFO L93 Difference]: Finished difference Result 351 states and 521 transitions. [2024-11-02 19:54:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:54:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 24 [2024-11-02 19:54:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:45,650 INFO L225 Difference]: With dead ends: 351 [2024-11-02 19:54:45,651 INFO L226 Difference]: Without dead ends: 260 [2024-11-02 19:54:45,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:45,656 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:45,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 156 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-02 19:54:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 182. [2024-11-02 19:54:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4364640883977902) internal successors, (260), 181 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2024-11-02 19:54:45,675 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 24 [2024-11-02 19:54:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:45,676 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2024-11-02 19:54:45,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2024-11-02 19:54:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 19:54:45,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:45,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:45,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:54:45,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1578156322, now seen corresponding path program 1 times [2024-11-02 19:54:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560322585] [2024-11-02 19:54:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:45,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:54:45,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:45,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:45,915 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:45,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560322585] [2024-11-02 19:54:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [560322585] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:45,915 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-11-02 19:54:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295079477] [2024-11-02 19:54:45,915 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:45,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:54:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:54:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:54:45,917 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:46,144 INFO L93 Difference]: Finished difference Result 658 states and 945 transitions. [2024-11-02 19:54:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:54:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 26 [2024-11-02 19:54:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:46,146 INFO L225 Difference]: With dead ends: 658 [2024-11-02 19:54:46,146 INFO L226 Difference]: Without dead ends: 492 [2024-11-02 19:54:46,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:46,148 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 191 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-02 19:54:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 430. [2024-11-02 19:54:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 429 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 609 transitions. [2024-11-02 19:54:46,188 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 609 transitions. Word has length 26 [2024-11-02 19:54:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 609 transitions. [2024-11-02 19:54:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 609 transitions. [2024-11-02 19:54:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 19:54:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:46,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:54:46,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1110801003, now seen corresponding path program 1 times [2024-11-02 19:54:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384294979] [2024-11-02 19:54:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:46,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:46,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:46,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:46,407 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384294979] [2024-11-02 19:54:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [384294979] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:46,407 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:46,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245027367] [2024-11-02 19:54:46,408 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:46,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:46,409 INFO L87 Difference]: Start difference. First operand 430 states and 609 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:46,421 INFO L93 Difference]: Finished difference Result 436 states and 614 transitions. [2024-11-02 19:54:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:54:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-02 19:54:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:46,422 INFO L225 Difference]: With dead ends: 436 [2024-11-02 19:54:46,422 INFO L226 Difference]: Without dead ends: 161 [2024-11-02 19:54:46,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:46,423 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:46,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-02 19:54:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-02 19:54:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.35625) internal successors, (217), 160 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) [2024-11-02 19:54:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-02 19:54:46,434 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 28 [2024-11-02 19:54:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:46,434 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-02 19:54:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-02 19:54:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:46,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:46,436 INFO L215 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] [2024-11-02 19:54:46,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:54:46,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 203288042, now seen corresponding path program 1 times [2024-11-02 19:54:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:46,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697378549] [2024-11-02 19:54:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:46,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:46,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-02 19:54:46,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-02 19:54:46,544 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697378549] [2024-11-02 19:54:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [697378549] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:46,545 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:46,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333552043] [2024-11-02 19:54:46,545 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:46,546 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:46,562 INFO L93 Difference]: Finished difference Result 217 states and 284 transitions. [2024-11-02 19:54:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:54:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 36 [2024-11-02 19:54:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:46,564 INFO L225 Difference]: With dead ends: 217 [2024-11-02 19:54:46,564 INFO L226 Difference]: Without dead ends: 211 [2024-11-02 19:54:46,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:46,565 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:46,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-02 19:54:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 189. [2024-11-02 19:54:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.3457446808510638) internal successors, (253), 188 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 253 transitions. [2024-11-02 19:54:46,573 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 253 transitions. Word has length 36 [2024-11-02 19:54:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:46,574 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 253 transitions. [2024-11-02 19:54:46,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 253 transitions. [2024-11-02 19:54:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:46,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:46,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:54:46,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:46,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash 461453480, now seen corresponding path program 1 times [2024-11-02 19:54:46,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923096849] [2024-11-02 19:54:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:46,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-02 19:54:46,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:46,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:46,905 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923096849] [2024-11-02 19:54:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [923096849] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:54:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:54:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-11-02 19:54:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617449466] [2024-11-02 19:54:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:46,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-02 19:54:46,907 INFO L87 Difference]: Start difference. First operand 189 states and 253 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:47,007 INFO L93 Difference]: Finished difference Result 430 states and 581 transitions. [2024-11-02 19:54:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:47,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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 36 [2024-11-02 19:54:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:47,008 INFO L225 Difference]: With dead ends: 430 [2024-11-02 19:54:47,008 INFO L226 Difference]: Without dead ends: 344 [2024-11-02 19:54:47,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-02 19:54:47,009 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 204 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:47,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 478 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-02 19:54:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 259. [2024-11-02 19:54:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.3410852713178294) internal successors, (346), 258 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 346 transitions. [2024-11-02 19:54:47,018 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 346 transitions. Word has length 36 [2024-11-02 19:54:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:47,018 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 346 transitions. [2024-11-02 19:54:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2024-11-02 19:54:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:47,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:47,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:54:47,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash 736213094, now seen corresponding path program 1 times [2024-11-02 19:54:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082744708] [2024-11-02 19:54:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:47,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:47,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:47,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:47,533 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082744708] [2024-11-02 19:54:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2082744708] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:47,533 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-02 19:54:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484573457] [2024-11-02 19:54:47,534 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:47,535 INFO L87 Difference]: Start difference. First operand 259 states and 346 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:47,903 INFO L93 Difference]: Finished difference Result 693 states and 943 transitions. [2024-11-02 19:54:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 19:54:47,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 36 [2024-11-02 19:54:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:47,907 INFO L225 Difference]: With dead ends: 693 [2024-11-02 19:54:47,907 INFO L226 Difference]: Without dead ends: 461 [2024-11-02 19:54:47,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:47,909 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 155 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:47,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 158 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-02 19:54:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 370. [2024-11-02 19:54:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.3658536585365855) internal successors, (504), 369 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 504 transitions. [2024-11-02 19:54:47,929 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 504 transitions. Word has length 36 [2024-11-02 19:54:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:47,929 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 504 transitions. [2024-11-02 19:54:47,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 504 transitions. [2024-11-02 19:54:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:47,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:47,931 INFO L215 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] [2024-11-02 19:54:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 19:54:47,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1158914920, now seen corresponding path program 1 times [2024-11-02 19:54:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713311081] [2024-11-02 19:54:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:47,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:47,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,090 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713311081] [2024-11-02 19:54:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [713311081] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:54:48,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:54:48,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-02 19:54:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297609142] [2024-11-02 19:54:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:48,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 19:54:48,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 19:54:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:48,091 INFO L87 Difference]: Start difference. First operand 370 states and 504 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:48,194 INFO L93 Difference]: Finished difference Result 732 states and 1000 transitions. [2024-11-02 19:54:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 19:54:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-02 19:54:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:48,195 INFO L225 Difference]: With dead ends: 732 [2024-11-02 19:54:48,196 INFO L226 Difference]: Without dead ends: 391 [2024-11-02 19:54:48,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:48,196 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:48,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-02 19:54:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 369. [2024-11-02 19:54:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.3532608695652173) internal successors, (498), 368 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 498 transitions. [2024-11-02 19:54:48,215 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 498 transitions. Word has length 36 [2024-11-02 19:54:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 498 transitions. [2024-11-02 19:54:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 498 transitions. [2024-11-02 19:54:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 19:54:48,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:48,216 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 19:54:48,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 19:54:48,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:48,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2086747953, now seen corresponding path program 1 times [2024-11-02 19:54:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:48,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854779763] [2024-11-02 19:54:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:48,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-02 19:54:48,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,574 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854779763] [2024-11-02 19:54:48,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [854779763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:48,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-02 19:54:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795416155] [2024-11-02 19:54:48,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-02 19:54:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-02 19:54:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-02 19:54:48,576 INFO L87 Difference]: Start difference. First operand 369 states and 498 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:48,938 INFO L93 Difference]: Finished difference Result 808 states and 1108 transitions. [2024-11-02 19:54:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-02 19:54:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 38 [2024-11-02 19:54:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:48,940 INFO L225 Difference]: With dead ends: 808 [2024-11-02 19:54:48,940 INFO L226 Difference]: Without dead ends: 468 [2024-11-02 19:54:48,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-11-02 19:54:48,941 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 274 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:48,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 84 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-02 19:54:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 432. [2024-11-02 19:54:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.3248259860788862) internal successors, (571), 431 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 571 transitions. [2024-11-02 19:54:48,954 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 571 transitions. Word has length 38 [2024-11-02 19:54:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:48,954 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 571 transitions. [2024-11-02 19:54:48,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 571 transitions. [2024-11-02 19:54:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-02 19:54:48,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:48,955 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 19:54:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 19:54:48,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -6345638, now seen corresponding path program 1 times [2024-11-02 19:54:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808840318] [2024-11-02 19:54:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:49,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:54:49,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:49,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:49,212 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808840318] [2024-11-02 19:54:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1808840318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:49,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 19:54:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850396120] [2024-11-02 19:54:49,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:49,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:49,213 INFO L87 Difference]: Start difference. First operand 432 states and 571 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:49,473 INFO L93 Difference]: Finished difference Result 1139 states and 1565 transitions. [2024-11-02 19:54:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 40 [2024-11-02 19:54:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:49,475 INFO L225 Difference]: With dead ends: 1139 [2024-11-02 19:54:49,475 INFO L226 Difference]: Without dead ends: 711 [2024-11-02 19:54:49,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:49,476 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 103 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:49,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 76 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-02 19:54:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 617. [2024-11-02 19:54:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.3165584415584415) internal successors, (811), 616 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 811 transitions. [2024-11-02 19:54:49,495 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 811 transitions. Word has length 40 [2024-11-02 19:54:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:49,495 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 811 transitions. [2024-11-02 19:54:49,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 811 transitions. [2024-11-02 19:54:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-02 19:54:49,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:49,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:49,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 19:54:49,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:49,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -694482118, now seen corresponding path program 1 times [2024-11-02 19:54:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510167308] [2024-11-02 19:54:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:49,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-02 19:54:49,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-02 19:54:49,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-02 19:54:49,739 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510167308] [2024-11-02 19:54:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1510167308] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:49,739 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:49,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 13 [2024-11-02 19:54:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357165670] [2024-11-02 19:54:49,739 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 19:54:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 19:54:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-02 19:54:49,740 INFO L87 Difference]: Start difference. First operand 617 states and 811 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:50,257 INFO L93 Difference]: Finished difference Result 1599 states and 2122 transitions. [2024-11-02 19:54:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-02 19:54:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 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 66 [2024-11-02 19:54:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:50,260 INFO L225 Difference]: With dead ends: 1599 [2024-11-02 19:54:50,260 INFO L226 Difference]: Without dead ends: 992 [2024-11-02 19:54:50,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2024-11-02 19:54:50,262 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 587 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:50,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 215 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:54:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-02 19:54:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 920. [2024-11-02 19:54:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.3122959738846571) internal successors, (1206), 919 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1206 transitions. [2024-11-02 19:54:50,297 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1206 transitions. Word has length 66 [2024-11-02 19:54:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:50,297 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1206 transitions. [2024-11-02 19:54:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1206 transitions. [2024-11-02 19:54:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-02 19:54:50,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:50,299 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 19:54:50,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1866953413, now seen corresponding path program 1 times [2024-11-02 19:54:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316803882] [2024-11-02 19:54:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:50,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-02 19:54:50,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-02 19:54:50,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-02 19:54:50,579 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316803882] [2024-11-02 19:54:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [316803882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:50,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-02 19:54:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498774454] [2024-11-02 19:54:50,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 19:54:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 19:54:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:50,581 INFO L87 Difference]: Start difference. First operand 920 states and 1206 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:50,807 INFO L93 Difference]: Finished difference Result 1864 states and 2397 transitions. [2024-11-02 19:54:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-02 19:54:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-02 19:54:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:50,810 INFO L225 Difference]: With dead ends: 1864 [2024-11-02 19:54:50,811 INFO L226 Difference]: Without dead ends: 970 [2024-11-02 19:54:50,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-02 19:54:50,812 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 160 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:50,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 252 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-02 19:54:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 667. [2024-11-02 19:54:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.2912912912912913) internal successors, (860), 666 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 860 transitions. [2024-11-02 19:54:50,840 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 860 transitions. Word has length 69 [2024-11-02 19:54:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 860 transitions. [2024-11-02 19:54:50,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 860 transitions. [2024-11-02 19:54:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-02 19:54:50,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:50,841 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:50,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 19:54:50,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:50,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash 978142725, now seen corresponding path program 2 times [2024-11-02 19:54:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:50,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071411166] [2024-11-02 19:54:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:51,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-02 19:54:51,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-02 19:54:51,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-02 19:54:52,058 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071411166] [2024-11-02 19:54:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2071411166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:52,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2024-11-02 19:54:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146110423] [2024-11-02 19:54:52,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-02 19:54:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-02 19:54:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-02 19:54:52,060 INFO L87 Difference]: Start difference. First operand 667 states and 860 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:53,345 INFO L93 Difference]: Finished difference Result 1496 states and 1922 transitions. [2024-11-02 19:54:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-02 19:54:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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 69 [2024-11-02 19:54:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:53,353 INFO L225 Difference]: With dead ends: 1496 [2024-11-02 19:54:53,353 INFO L226 Difference]: Without dead ends: 797 [2024-11-02 19:54:53,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2024-11-02 19:54:53,358 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 508 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:53,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 148 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-02 19:54:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-02 19:54:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 723. [2024-11-02 19:54:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.2645429362880887) internal successors, (913), 722 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 913 transitions. [2024-11-02 19:54:53,433 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 913 transitions. Word has length 69 [2024-11-02 19:54:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:53,434 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 913 transitions. [2024-11-02 19:54:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 913 transitions. [2024-11-02 19:54:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-02 19:54:53,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:53,439 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:53,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 19:54:53,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:53,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 1 times [2024-11-02 19:54:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1826047592] [2024-11-02 19:54:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:06,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-02 19:55:06,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:08,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:11,137 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1826047592] [2024-11-02 19:55:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1826047592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:11,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2024-11-02 19:55:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598887034] [2024-11-02 19:55:11,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:11,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-02 19:55:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-02 19:55:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2003, Unknown=0, NotChecked=0, Total=2162 [2024-11-02 19:55:11,139 INFO L87 Difference]: Start difference. First operand 723 states and 913 transitions. Second operand has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:23,467 INFO L93 Difference]: Finished difference Result 1441 states and 1782 transitions. [2024-11-02 19:55:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-02 19:55:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 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 70 [2024-11-02 19:55:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:23,471 INFO L225 Difference]: With dead ends: 1441 [2024-11-02 19:55:23,471 INFO L226 Difference]: Without dead ends: 1272 [2024-11-02 19:55:23,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3091 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2500, Invalid=13502, Unknown=0, NotChecked=0, Total=16002 [2024-11-02 19:55:23,475 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 1357 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 4622 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 5105 SdHoareTripleChecker+Invalid, 4718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:23,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 5105 Invalid, 4718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4622 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-02 19:55:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-02 19:55:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 952. [2024-11-02 19:55:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 1.2786540483701367) internal successors, (1216), 951 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1216 transitions. [2024-11-02 19:55:23,523 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1216 transitions. Word has length 70 [2024-11-02 19:55:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:23,523 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1216 transitions. [2024-11-02 19:55:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1216 transitions. [2024-11-02 19:55:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-02 19:55:23,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:23,524 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-02 19:55:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 19:55:23,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:23,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1275590724, now seen corresponding path program 1 times [2024-11-02 19:55:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1800493876] [2024-11-02 19:55:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:23,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-02 19:55:23,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-02 19:55:23,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-02 19:55:23,778 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1800493876] [2024-11-02 19:55:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1800493876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:23,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-02 19:55:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617149091] [2024-11-02 19:55:23,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:23,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 19:55:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 19:55:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:55:23,779 INFO L87 Difference]: Start difference. First operand 952 states and 1216 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:24,009 INFO L93 Difference]: Finished difference Result 1344 states and 1673 transitions. [2024-11-02 19:55:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-02 19:55:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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 74 [2024-11-02 19:55:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:24,013 INFO L225 Difference]: With dead ends: 1344 [2024-11-02 19:55:24,013 INFO L226 Difference]: Without dead ends: 1137 [2024-11-02 19:55:24,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-11-02 19:55:24,014 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 137 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:24,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 284 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-02 19:55:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 901. [2024-11-02 19:55:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.2755555555555556) internal successors, (1148), 900 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1148 transitions. [2024-11-02 19:55:24,060 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1148 transitions. Word has length 74 [2024-11-02 19:55:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:24,060 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1148 transitions. [2024-11-02 19:55:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1148 transitions. [2024-11-02 19:55:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-02 19:55:24,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:24,062 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 19:55:24,062 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:24,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 2 times [2024-11-02 19:55:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:24,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266249529] [2024-11-02 19:55:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:44,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-02 19:55:44,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:47,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:50,068 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266249529] [2024-11-02 19:55:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1266249529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:50,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:50,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2024-11-02 19:55:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888529943] [2024-11-02 19:55:50,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:50,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-02 19:55:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-02 19:55:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2276, Unknown=0, NotChecked=0, Total=2450 [2024-11-02 19:55:50,071 INFO L87 Difference]: Start difference. First operand 901 states and 1148 transitions. Second operand has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)