/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/s3_srvr_2a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:56:02,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:56:02,513 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:56:02,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:56:02,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:56:02,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:56:02,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:56:02,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:56:02,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:56:02,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:56:02,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:56:02,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:56:02,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:56:02,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:56:02,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:56:02,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:56:02,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:56:02,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:56:02,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:56:02,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:56:02,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:56:02,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:56:02,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:56:02,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:56:02,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:56:02,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:56:02,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:56:02,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:56:02,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:56:02,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:56:02,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:56:02,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:56:02,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:56:02,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:56:02,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:56:02,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:56:02,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:56:02,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:56:02,549 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:56:02,549 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:56:02,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:56:02,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:56:02,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:56:02,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:56:02,551 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:56:02,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:56:02,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:56:02,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:56:02,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:56:02,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:56:02,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2024-11-02 19:56:04,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:56:04,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:56:04,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2024-11-02 19:56:04,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99031f529/08ccce928f354c9ca6b8523cfd88b75e/FLAGb4cfcad9d [2024-11-02 19:56:04,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99031f529/08ccce928f354c9ca6b8523cfd88b75e [2024-11-02 19:56:04,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:56:04,268 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:56:04,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:56:04,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:56:04,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:56:04,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb1cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04, skipping insertion in model container [2024-11-02 19:56:04,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:56:04,487 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/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2024-11-02 19:56:04,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:56:04,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:56:04,543 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/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2024-11-02 19:56:04,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:56:04,564 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:56:04,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04 WrapperNode [2024-11-02 19:56:04,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:56:04,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:56:04,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:56:04,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:56:04,571 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:56:04" (1/1) ... [2024-11-02 19:56:04,581 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:56:04" (1/1) ... [2024-11-02 19:56:04,605 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2024-11-02 19:56:04,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:56:04,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:56:04,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:56:04,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:56:04,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,651 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:56:04,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:56:04,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:56:04,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:56:04,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:56:04,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (1/1) ... [2024-11-02 19:56:04,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:56:04,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:56:04,704 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:56:04,707 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:56:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:56:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:56:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:56:04,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:56:04,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:56:04,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:56:04,856 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-02 19:56:05,301 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2024-11-02 19:56:05,301 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2024-11-02 19:56:05,349 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-02 19:56:05,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:56:05,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:56:05,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 19:56:05,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:05 BoogieIcfgContainer [2024-11-02 19:56:05,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:56:05,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:56:05,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:56:05,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:56:05,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:56:04" (1/3) ... [2024-11-02 19:56:05,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a87e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:05, skipping insertion in model container [2024-11-02 19:56:05,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:04" (2/3) ... [2024-11-02 19:56:05,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a87e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:05, skipping insertion in model container [2024-11-02 19:56:05,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:05" (3/3) ... [2024-11-02 19:56:05,378 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2024-11-02 19:56:05,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:56:05,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:56:05,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:56:05,438 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;@6b5a9c02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:56:05,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:56:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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:56:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-02 19:56:05,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:05,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:05,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2024-11-02 19:56:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532089016] [2024-11-02 19:56:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:05,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:56:05,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:05,653 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:56:05,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:05,692 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:56:05,694 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532089016] [2024-11-02 19:56:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1532089016] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:05,695 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:05,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:56:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288138538] [2024-11-02 19:56:05,697 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:05,725 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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:56:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:05,885 INFO L93 Difference]: Finished difference Result 275 states and 473 transitions. [2024-11-02 19:56:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-02 19:56:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:05,895 INFO L225 Difference]: With dead ends: 275 [2024-11-02 19:56:05,895 INFO L226 Difference]: Without dead ends: 125 [2024-11-02 19:56:05,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:05,901 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:05,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 325 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-02 19:56:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-02 19:56:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:56:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2024-11-02 19:56:05,940 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2024-11-02 19:56:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:05,940 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2024-11-02 19:56:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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:56:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2024-11-02 19:56:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-02 19:56:05,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:05,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:56:05,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:05,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2024-11-02 19:56:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253649446] [2024-11-02 19:56:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:05,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:06,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:56:06,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:06,164 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:56:06,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:06,254 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:56:06,254 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253649446] [2024-11-02 19:56:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [253649446] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:06,255 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:06,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:56:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901044077] [2024-11-02 19:56:06,256 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:56:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:56:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:56:06,259 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:56:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:06,328 INFO L93 Difference]: Finished difference Result 432 states and 659 transitions. [2024-11-02 19:56:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:56:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 60 [2024-11-02 19:56:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:06,330 INFO L225 Difference]: With dead ends: 432 [2024-11-02 19:56:06,330 INFO L226 Difference]: Without dead ends: 326 [2024-11-02 19:56:06,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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:56:06,333 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 346 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:06,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 487 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:56:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-02 19:56:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-02 19:56:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 325 states have internal predecessors, (492), 0 states have call successors, (0), 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:56:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 492 transitions. [2024-11-02 19:56:06,372 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 492 transitions. Word has length 60 [2024-11-02 19:56:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:06,373 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 492 transitions. [2024-11-02 19:56:06,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:56:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2024-11-02 19:56:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-02 19:56:06,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:06,376 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:06,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:56:06,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:06,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1976048908, now seen corresponding path program 1 times [2024-11-02 19:56:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566437652] [2024-11-02 19:56:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:06,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:56:06,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:56:06,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:56:06,501 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566437652] [2024-11-02 19:56:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1566437652] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:06,502 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:56:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013059085] [2024-11-02 19:56:06,502 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:06,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:06,507 INFO L87 Difference]: Start difference. First operand 326 states and 492 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:56:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:06,525 INFO L93 Difference]: Finished difference Result 635 states and 964 transitions. [2024-11-02 19:56:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 82 [2024-11-02 19:56:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:06,527 INFO L225 Difference]: With dead ends: 635 [2024-11-02 19:56:06,527 INFO L226 Difference]: Without dead ends: 328 [2024-11-02 19:56:06,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:06,532 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:06,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:56:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-02 19:56:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-02 19:56:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.510703363914373) internal successors, (494), 327 states have internal predecessors, (494), 0 states have call successors, (0), 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:56:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 494 transitions. [2024-11-02 19:56:06,545 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 494 transitions. Word has length 82 [2024-11-02 19:56:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 494 transitions. [2024-11-02 19:56:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:56:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 494 transitions. [2024-11-02 19:56:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-02 19:56:06,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:06,549 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:06,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:56:06,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:06,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1614320406, now seen corresponding path program 1 times [2024-11-02 19:56:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131245593] [2024-11-02 19:56:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:06,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:56:06,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-02 19:56:06,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-02 19:56:06,738 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131245593] [2024-11-02 19:56:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [131245593] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:56:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:56:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-02 19:56:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336614675] [2024-11-02 19:56:06,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:06,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:06,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:06,741 INFO L87 Difference]: Start difference. First operand 328 states and 494 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:56:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:06,891 INFO L93 Difference]: Finished difference Result 760 states and 1181 transitions. [2024-11-02 19:56:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 103 [2024-11-02 19:56:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:06,893 INFO L225 Difference]: With dead ends: 760 [2024-11-02 19:56:06,893 INFO L226 Difference]: Without dead ends: 453 [2024-11-02 19:56:06,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:06,895 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:06,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 272 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-02 19:56:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-02 19:56:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.4026548672566372) internal successors, (634), 452 states have internal predecessors, (634), 0 states have call successors, (0), 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:56:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 634 transitions. [2024-11-02 19:56:06,912 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 634 transitions. Word has length 103 [2024-11-02 19:56:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 634 transitions. [2024-11-02 19:56:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:56:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 634 transitions. [2024-11-02 19:56:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-02 19:56:06,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:06,918 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:06,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:56:06,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1420566810, now seen corresponding path program 1 times [2024-11-02 19:56:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767404206] [2024-11-02 19:56:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:06,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:56:06,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-02 19:56:06,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-02 19:56:07,034 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767404206] [2024-11-02 19:56:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [767404206] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:56:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:56:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-02 19:56:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527699175] [2024-11-02 19:56:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:07,036 INFO L87 Difference]: Start difference. First operand 453 states and 634 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:56:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:07,153 INFO L93 Difference]: Finished difference Result 931 states and 1317 transitions. [2024-11-02 19:56:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 103 [2024-11-02 19:56:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:07,155 INFO L225 Difference]: With dead ends: 931 [2024-11-02 19:56:07,155 INFO L226 Difference]: Without dead ends: 499 [2024-11-02 19:56:07,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:07,159 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:07,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-02 19:56:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2024-11-02 19:56:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.3855421686746987) internal successors, (690), 498 states have internal predecessors, (690), 0 states have call successors, (0), 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:56:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 690 transitions. [2024-11-02 19:56:07,178 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 690 transitions. Word has length 103 [2024-11-02 19:56:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:07,179 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 690 transitions. [2024-11-02 19:56:07,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:56:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 690 transitions. [2024-11-02 19:56:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-02 19:56:07,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:07,181 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:07,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:56:07,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1506722242, now seen corresponding path program 1 times [2024-11-02 19:56:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21385771] [2024-11-02 19:56:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:07,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:56:07,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-02 19:56:07,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-02 19:56:07,406 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21385771] [2024-11-02 19:56:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [21385771] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:07,407 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:56:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758851144] [2024-11-02 19:56:07,407 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:56:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:56:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:56:07,409 INFO L87 Difference]: Start difference. First operand 499 states and 690 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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:56:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:07,444 INFO L93 Difference]: Finished difference Result 1286 states and 1790 transitions. [2024-11-02 19:56:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:56:07,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 143 [2024-11-02 19:56:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:07,446 INFO L225 Difference]: With dead ends: 1286 [2024-11-02 19:56:07,446 INFO L226 Difference]: Without dead ends: 808 [2024-11-02 19:56:07,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 282 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:56:07,451 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 268 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:07,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 620 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:56:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-02 19:56:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-02 19:56:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.3866171003717471) internal successors, (1119), 807 states have internal predecessors, (1119), 0 states have call successors, (0), 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:56:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1119 transitions. [2024-11-02 19:56:07,464 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1119 transitions. Word has length 143 [2024-11-02 19:56:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1119 transitions. [2024-11-02 19:56:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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:56:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1119 transitions. [2024-11-02 19:56:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-02 19:56:07,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:07,467 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:07,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:56:07,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 778746127, now seen corresponding path program 1 times [2024-11-02 19:56:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077905719] [2024-11-02 19:56:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:07,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:07,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:56:07,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-02 19:56:07,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-02 19:56:07,703 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077905719] [2024-11-02 19:56:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2077905719] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:07,704 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:56:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927081959] [2024-11-02 19:56:07,704 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:07,705 INFO L87 Difference]: Start difference. First operand 808 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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:56:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:07,729 INFO L93 Difference]: Finished difference Result 2217 states and 3117 transitions. [2024-11-02 19:56:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 163 [2024-11-02 19:56:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:07,735 INFO L225 Difference]: With dead ends: 2217 [2024-11-02 19:56:07,735 INFO L226 Difference]: Without dead ends: 1430 [2024-11-02 19:56:07,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:56:07,737 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 110 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:07,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 491 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:56:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-02 19:56:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1428. [2024-11-02 19:56:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.4085494043447793) internal successors, (2010), 1427 states have internal predecessors, (2010), 0 states have call successors, (0), 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:56:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2010 transitions. [2024-11-02 19:56:07,766 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2010 transitions. Word has length 163 [2024-11-02 19:56:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2010 transitions. [2024-11-02 19:56:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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:56:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2010 transitions. [2024-11-02 19:56:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-02 19:56:07,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:07,796 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:56:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:56:07,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1067369758, now seen corresponding path program 1 times [2024-11-02 19:56:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412606484] [2024-11-02 19:56:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:07,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:56:07,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-02 19:56:07,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 192 proven. 33 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-02 19:56:07,933 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412606484] [2024-11-02 19:56:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [412606484] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:56:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:56:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-02 19:56:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657697120] [2024-11-02 19:56:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:07,935 INFO L87 Difference]: Start difference. First operand 1428 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:56:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:08,070 INFO L93 Difference]: Finished difference Result 3171 states and 4595 transitions. [2024-11-02 19:56:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2024-11-02 19:56:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:08,077 INFO L225 Difference]: With dead ends: 3171 [2024-11-02 19:56:08,077 INFO L226 Difference]: Without dead ends: 1764 [2024-11-02 19:56:08,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:56:08,079 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 30 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:08,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 271 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-02 19:56:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2024-11-02 19:56:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.3533749290981283) internal successors, (2386), 1763 states have internal predecessors, (2386), 0 states have call successors, (0), 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:56:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2386 transitions. [2024-11-02 19:56:08,110 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2386 transitions. Word has length 183 [2024-11-02 19:56:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2386 transitions. [2024-11-02 19:56:08,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:56:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2386 transitions. [2024-11-02 19:56:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-02 19:56:08,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:08,117 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:08,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:56:08,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:08,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2024-11-02 19:56:08,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:08,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883763122] [2024-11-02 19:56:08,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:08,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:08,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:56:08,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:10,618 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_ssl3_accept_~ag_X~0#1| (_ BitVec 32)) (|ULTIMATE.start_ssl3_accept_~ag_Y~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_ssl3_accept_~s__state~0#1| (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) is different from true [2024-11-02 19:56:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 294 proven. 0 refuted. 32 times theorem prover too weak. 92 trivial. 16 not checked. [2024-11-02 19:56:10,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-02 19:56:10,765 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883763122] [2024-11-02 19:56:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883763122] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:56:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:56:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-02 19:56:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938031724] [2024-11-02 19:56:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:10,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=7, Unknown=1, NotChecked=4, Total=20 [2024-11-02 19:56:10,766 INFO L87 Difference]: Start difference. First operand 1764 states and 2386 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:56:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:10,879 INFO L93 Difference]: Finished difference Result 3717 states and 5077 transitions. [2024-11-02 19:56:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-02 19:56:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:10,885 INFO L225 Difference]: With dead ends: 3717 [2024-11-02 19:56:10,885 INFO L226 Difference]: Without dead ends: 1974 [2024-11-02 19:56:10,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8, Invalid=7, Unknown=1, NotChecked=4, Total=20 [2024-11-02 19:56:10,887 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:10,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 202 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-11-02 19:56:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2024-11-02 19:56:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 1.3715154586923466) internal successors, (2706), 1973 states have internal predecessors, (2706), 0 states have call successors, (0), 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:56:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2706 transitions. [2024-11-02 19:56:10,918 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2706 transitions. Word has length 225 [2024-11-02 19:56:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 2706 transitions. [2024-11-02 19:56:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:56:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2706 transitions. [2024-11-02 19:56:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-02 19:56:10,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:10,922 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 19:56:10,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash -222886975, now seen corresponding path program 1 times [2024-11-02 19:56:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795375494] [2024-11-02 19:56:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:10,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:56:10,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 303 proven. 9 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-02 19:56:11,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-02 19:56:11,064 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795375494] [2024-11-02 19:56:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [795375494] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:56:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:56:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-02 19:56:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059736233] [2024-11-02 19:56:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:56:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:56:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:56:11,066 INFO L87 Difference]: Start difference. First operand 1974 states and 2706 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:56:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:11,188 INFO L93 Difference]: Finished difference Result 4147 states and 5737 transitions. [2024-11-02 19:56:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:56:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 226 [2024-11-02 19:56:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:11,195 INFO L225 Difference]: With dead ends: 4147 [2024-11-02 19:56:11,196 INFO L226 Difference]: Without dead ends: 2194 [2024-11-02 19:56:11,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 448 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:56:11,198 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:11,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 181 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2024-11-02 19:56:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2194. [2024-11-02 19:56:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2193 states have (on average 1.3889648882808938) internal successors, (3046), 2193 states have internal predecessors, (3046), 0 states have call successors, (0), 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:56:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3046 transitions. [2024-11-02 19:56:11,247 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3046 transitions. Word has length 226 [2024-11-02 19:56:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:11,247 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 3046 transitions. [2024-11-02 19:56:11,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:56:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3046 transitions. [2024-11-02 19:56:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-02 19:56:11,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:11,252 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:11,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 19:56:11,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1252165159, now seen corresponding path program 1 times [2024-11-02 19:56:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944224179] [2024-11-02 19:56:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:11,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:56:11,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-02 19:56:11,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-02 19:56:11,355 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944224179] [2024-11-02 19:56:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1944224179] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:56:11,355 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:56:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:56:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507606201] [2024-11-02 19:56:11,356 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:56:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:56:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:56:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:56:11,357 INFO L87 Difference]: Start difference. First operand 2194 states and 3046 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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:56:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:56:11,513 INFO L93 Difference]: Finished difference Result 4677 states and 6577 transitions. [2024-11-02 19:56:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:56:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 241 [2024-11-02 19:56:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:56:11,520 INFO L225 Difference]: With dead ends: 4677 [2024-11-02 19:56:11,520 INFO L226 Difference]: Without dead ends: 2504 [2024-11-02 19:56:11,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 478 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:56:11,522 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 69 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:56:11,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:56:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-11-02 19:56:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2024-11-02 19:56:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 1.3567718737514982) internal successors, (3396), 2503 states have internal predecessors, (3396), 0 states have call successors, (0), 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:56:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3396 transitions. [2024-11-02 19:56:11,561 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3396 transitions. Word has length 241 [2024-11-02 19:56:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:56:11,561 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3396 transitions. [2024-11-02 19:56:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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:56:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3396 transitions. [2024-11-02 19:56:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-02 19:56:11,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:56:11,565 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:56:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 19:56:11,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:56:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:56:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2024-11-02 19:56:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:56:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1213594936] [2024-11-02 19:56:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:56:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:56:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:56:11,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:56:11,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:56:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 425 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-02 19:56:11,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:56:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-02 19:56:13,656 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:56:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1213594936] [2024-11-02 19:56:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1213594936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:56:13,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:56:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2024-11-02 19:56:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861944428] [2024-11-02 19:56:13,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:56:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:56:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:56:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:56:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:56:13,658 INFO L87 Difference]: Start difference. First operand 2504 states and 3396 transitions. Second operand has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 0 states have call successors, (0), 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:56:16,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:19,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:22,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:26,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:29,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:33,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:36,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:41,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:44,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:45,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:49,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:52,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:56,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:56:59,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:02,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:04,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:07,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:10,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:13,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:18,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:23,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:28,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:34,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:37,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:40,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:45,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-02 19:57:49,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]