/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_3a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-10-31 15:04:22,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 15:04:22,992 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-10-31 15:04:23,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 15:04:23,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 15:04:23,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 15:04:23,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 15:04:23,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 15:04:23,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 15:04:23,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 15:04:23,046 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 15:04:23,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 15:04:23,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 15:04:23,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 15:04:23,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 15:04:23,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 15:04:23,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 15:04:23,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 15:04:23,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 15:04:23,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 15:04:23,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 15:04:23,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 15:04:23,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 15:04:23,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 15:04:23,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 15:04:23,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 15:04:23,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 15:04:23,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 15:04:23,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 15:04:23,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 15:04:23,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:04:23,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 15:04:23,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 15:04:23,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 15:04:23,058 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 15:04:23,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 15:04:23,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 15:04:23,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 15:04:23,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 15:04:23,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 15:04:23,061 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 15:04:23,061 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-10-31 15:04:23,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 15:04:23,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 15:04:23,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 15:04:23,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 15:04:23,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 15:04:23,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2024-10-31 15:04:24,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 15:04:24,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 15:04:24,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2024-10-31 15:04:24,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bee55dee/f563081bb268403f834e0e4436e2d9bf/FLAG8c755d6d6 [2024-10-31 15:04:25,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bee55dee/f563081bb268403f834e0e4436e2d9bf [2024-10-31 15:04:25,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 15:04:25,305 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-31 15:04:25,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 15:04:25,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 15:04:25,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 15:04:25,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64063d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25, skipping insertion in model container [2024-10-31 15:04:25,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 15:04:25,609 WARN L251 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_3a_alt.BV.c.cil.c[44628,44641] [2024-10-31 15:04:25,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:04:25,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 15:04:25,711 WARN L251 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_3a_alt.BV.c.cil.c[44628,44641] [2024-10-31 15:04:25,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:04:25,734 INFO L204 MainTranslator]: Completed translation [2024-10-31 15:04:25,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25 WrapperNode [2024-10-31 15:04:25,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 15:04:25,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 15:04:25,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 15:04:25,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 15:04:25,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,805 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 514 [2024-10-31 15:04:25,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 15:04:25,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 15:04:25,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 15:04:25,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 15:04:25,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,851 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-10-31 15:04:25,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 15:04:25,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 15:04:25,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 15:04:25,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 15:04:25,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (1/1) ... [2024-10-31 15:04:25,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:04:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-31 15:04:25,921 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-10-31 15:04:25,924 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-10-31 15:04:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 15:04:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 15:04:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 15:04:25,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 15:04:26,059 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 15:04:26,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 15:04:26,087 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 15:04:26,659 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2024-10-31 15:04:26,659 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2024-10-31 15:04:26,721 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-31 15:04:26,721 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 15:04:26,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 15:04:26,767 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 15:04:26,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:04:26 BoogieIcfgContainer [2024-10-31 15:04:26,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 15:04:26,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 15:04:26,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 15:04:26,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 15:04:26,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 03:04:25" (1/3) ... [2024-10-31 15:04:26,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c263eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:04:26, skipping insertion in model container [2024-10-31 15:04:26,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:04:25" (2/3) ... [2024-10-31 15:04:26,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c263eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:04:26, skipping insertion in model container [2024-10-31 15:04:26,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:04:26" (3/3) ... [2024-10-31 15:04:26,778 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2024-10-31 15:04:26,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 15:04:26,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 15:04:26,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 15:04:26,859 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;@26b46d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 15:04:26,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 15:04:26,865 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-10-31 15:04:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-31 15:04:26,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:26,874 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-10-31 15:04:26,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2024-10-31 15:04:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:26,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140432961] [2024-10-31 15:04:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:27,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 15:04:27,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:04:27,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:04:27,261 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:27,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140432961] [2024-10-31 15:04:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2140432961] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:27,262 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961253244] [2024-10-31 15:04:27,265 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:27,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:27,300 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-10-31 15:04:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:27,549 INFO L93 Difference]: Finished difference Result 275 states and 473 transitions. [2024-10-31 15:04:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:27,551 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-10-31 15:04:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:27,561 INFO L225 Difference]: With dead ends: 275 [2024-10-31 15:04:27,562 INFO L226 Difference]: Without dead ends: 125 [2024-10-31 15:04:27,565 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-10-31 15:04:27,569 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:27,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 324 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-31 15:04:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-10-31 15:04:27,616 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-10-31 15:04:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2024-10-31 15:04:27,622 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2024-10-31 15:04:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2024-10-31 15:04:27,623 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-10-31 15:04:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2024-10-31 15:04:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-31 15:04:27,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:27,627 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-10-31 15:04:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 15:04:27,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1722912794, now seen corresponding path program 1 times [2024-10-31 15:04:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4715720] [2024-10-31 15:04:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:27,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:27,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:04:27,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:04:27,839 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4715720] [2024-10-31 15:04:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [4715720] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:27,840 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945838420] [2024-10-31 15:04:27,840 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:27,846 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-31 15:04:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:28,045 INFO L93 Difference]: Finished difference Result 252 states and 380 transitions. [2024-10-31 15:04:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-31 15:04:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:28,047 INFO L225 Difference]: With dead ends: 252 [2024-10-31 15:04:28,047 INFO L226 Difference]: Without dead ends: 146 [2024-10-31 15:04:28,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 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-10-31 15:04:28,050 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:28,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 255 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-31 15:04:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-31 15:04:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4551724137931035) internal successors, (211), 145 states have internal predecessors, (211), 0 states have call successors, (0), 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-10-31 15:04:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-10-31 15:04:28,071 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 60 [2024-10-31 15:04:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:28,071 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-10-31 15:04:28,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-31 15:04:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-10-31 15:04:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 15:04:28,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:28,075 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] [2024-10-31 15:04:28,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 15:04:28,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:28,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1797387181, now seen corresponding path program 1 times [2024-10-31 15:04:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175925461] [2024-10-31 15:04:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:28,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:28,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:28,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:28,318 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175925461] [2024-10-31 15:04:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1175925461] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:28,318 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724846464] [2024-10-31 15:04:28,319 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:28,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:28,321 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:28,507 INFO L93 Difference]: Finished difference Result 297 states and 437 transitions. [2024-10-31 15:04:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-31 15:04:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:28,510 INFO L225 Difference]: With dead ends: 297 [2024-10-31 15:04:28,510 INFO L226 Difference]: Without dead ends: 170 [2024-10-31 15:04:28,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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-10-31 15:04:28,512 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 268 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.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:28,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 268 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-31 15:04:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-31 15:04:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 0 states have call successors, (0), 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-10-31 15:04:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2024-10-31 15:04:28,532 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 81 [2024-10-31 15:04:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:28,533 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2024-10-31 15:04:28,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2024-10-31 15:04:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 15:04:28,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:28,537 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] [2024-10-31 15:04:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 15:04:28,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2045533675, now seen corresponding path program 1 times [2024-10-31 15:04:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1754723100] [2024-10-31 15:04:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:28,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:28,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:28,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:28,792 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1754723100] [2024-10-31 15:04:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1754723100] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:28,792 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485878937] [2024-10-31 15:04:28,792 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:28,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:28,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:28,798 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:29,033 INFO L93 Difference]: Finished difference Result 362 states and 529 transitions. [2024-10-31 15:04:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-31 15:04:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:29,035 INFO L225 Difference]: With dead ends: 362 [2024-10-31 15:04:29,035 INFO L226 Difference]: Without dead ends: 211 [2024-10-31 15:04:29,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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-10-31 15:04:29,039 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 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.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:29,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-31 15:04:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-31 15:04:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.361904761904762) internal successors, (286), 210 states have internal predecessors, (286), 0 states have call successors, (0), 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-10-31 15:04:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 286 transitions. [2024-10-31 15:04:29,052 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 286 transitions. Word has length 81 [2024-10-31 15:04:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:29,053 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 286 transitions. [2024-10-31 15:04:29,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 286 transitions. [2024-10-31 15:04:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-31 15:04:29,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:29,058 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 15:04:29,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 755662145, now seen corresponding path program 1 times [2024-10-31 15:04:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168845463] [2024-10-31 15:04:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:29,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:29,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:29,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:29,228 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168845463] [2024-10-31 15:04:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [168845463] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:29,228 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497205488] [2024-10-31 15:04:29,229 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:29,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:29,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:29,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:29,231 INFO L87 Difference]: Start difference. First operand 211 states and 286 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-31 15:04:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:29,404 INFO L93 Difference]: Finished difference Result 428 states and 590 transitions. [2024-10-31 15:04:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 101 [2024-10-31 15:04:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:29,407 INFO L225 Difference]: With dead ends: 428 [2024-10-31 15:04:29,407 INFO L226 Difference]: Without dead ends: 236 [2024-10-31 15:04:29,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-10-31 15:04:29,412 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:29,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 270 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-31 15:04:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-10-31 15:04:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3446808510638297) internal successors, (316), 235 states have internal predecessors, (316), 0 states have call successors, (0), 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-10-31 15:04:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2024-10-31 15:04:29,426 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 316 transitions. Word has length 101 [2024-10-31 15:04:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 316 transitions. [2024-10-31 15:04:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-31 15:04:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 316 transitions. [2024-10-31 15:04:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 15:04:29,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:29,428 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, 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] [2024-10-31 15:04:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 15:04:29,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2024-10-31 15:04:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [372502371] [2024-10-31 15:04:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:29,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:29,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:29,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 15:04:29,660 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [372502371] [2024-10-31 15:04:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [372502371] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:29,661 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513807127] [2024-10-31 15:04:29,661 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:29,663 INFO L87 Difference]: Start difference. First operand 236 states and 316 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-10-31 15:04:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:29,736 INFO L93 Difference]: Finished difference Result 666 states and 899 transitions. [2024-10-31 15:04:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2024-10-31 15:04:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:29,739 INFO L225 Difference]: With dead ends: 666 [2024-10-31 15:04:29,739 INFO L226 Difference]: Without dead ends: 449 [2024-10-31 15:04:29,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 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-10-31 15:04:29,742 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:29,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:04:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-31 15:04:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2024-10-31 15:04:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3415178571428572) internal successors, (601), 448 states have internal predecessors, (601), 0 states have call successors, (0), 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-10-31 15:04:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 601 transitions. [2024-10-31 15:04:29,765 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 601 transitions. Word has length 121 [2024-10-31 15:04:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:29,765 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 601 transitions. [2024-10-31 15:04:29,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-10-31 15:04:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 601 transitions. [2024-10-31 15:04:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 15:04:29,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:29,767 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, 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] [2024-10-31 15:04:29,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 15:04:29,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:29,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2024-10-31 15:04:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094626123] [2024-10-31 15:04:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:29,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 15:04:29,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:29,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:30,056 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094626123] [2024-10-31 15:04:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2094626123] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:30,057 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:04:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007554300] [2024-10-31 15:04:30,058 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:30,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:04:30,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:04:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:04:30,059 INFO L87 Difference]: Start difference. First operand 449 states and 601 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:30,153 INFO L93 Difference]: Finished difference Result 1302 states and 1754 transitions. [2024-10-31 15:04:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:04:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-31 15:04:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:30,159 INFO L225 Difference]: With dead ends: 1302 [2024-10-31 15:04:30,159 INFO L226 Difference]: Without dead ends: 872 [2024-10-31 15:04:30,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 238 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-10-31 15:04:30,161 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 297 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:30,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 561 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:04:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-31 15:04:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-31 15:04:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.3432835820895523) internal successors, (1170), 871 states have internal predecessors, (1170), 0 states have call successors, (0), 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-10-31 15:04:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1170 transitions. [2024-10-31 15:04:30,188 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1170 transitions. Word has length 121 [2024-10-31 15:04:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:30,189 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1170 transitions. [2024-10-31 15:04:30,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1170 transitions. [2024-10-31 15:04:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-31 15:04:30,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:30,194 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:30,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 15:04:30,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:30,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -247255522, now seen corresponding path program 1 times [2024-10-31 15:04:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2087868945] [2024-10-31 15:04:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:30,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:04:30,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:30,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-31 15:04:30,432 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:30,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2087868945] [2024-10-31 15:04:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2087868945] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:30,432 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2024-10-31 15:04:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390095147] [2024-10-31 15:04:30,433 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:30,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 15:04:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 15:04:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 15:04:30,435 INFO L87 Difference]: Start difference. First operand 872 states and 1170 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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-10-31 15:04:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:30,855 INFO L93 Difference]: Finished difference Result 2187 states and 3132 transitions. [2024-10-31 15:04:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 15:04:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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 159 [2024-10-31 15:04:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:30,862 INFO L225 Difference]: With dead ends: 2187 [2024-10-31 15:04:30,862 INFO L226 Difference]: Without dead ends: 1334 [2024-10-31 15:04:30,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 15:04:30,864 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 171 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:30,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 300 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 15:04:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-10-31 15:04:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1318. [2024-10-31 15:04:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4206529992406987) internal successors, (1871), 1317 states have internal predecessors, (1871), 0 states have call successors, (0), 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-10-31 15:04:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1871 transitions. [2024-10-31 15:04:30,899 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1871 transitions. Word has length 159 [2024-10-31 15:04:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1871 transitions. [2024-10-31 15:04:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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-10-31 15:04:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1871 transitions. [2024-10-31 15:04:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-31 15:04:30,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:30,904 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 15:04:30,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -14623420, now seen corresponding path program 1 times [2024-10-31 15:04:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278071446] [2024-10-31 15:04:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:30,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:30,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-31 15:04:30,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-31 15:04:31,040 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278071446] [2024-10-31 15:04:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1278071446] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:31,041 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375425222] [2024-10-31 15:04:31,041 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:31,042 INFO L87 Difference]: Start difference. First operand 1318 states and 1871 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-10-31 15:04:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:31,104 INFO L93 Difference]: Finished difference Result 2641 states and 3749 transitions. [2024-10-31 15:04:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-31 15:04:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:31,111 INFO L225 Difference]: With dead ends: 2641 [2024-10-31 15:04:31,111 INFO L226 Difference]: Without dead ends: 1342 [2024-10-31 15:04:31,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-10-31 15:04:31,114 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 346 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-10-31 15:04:31,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:04:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-31 15:04:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2024-10-31 15:04:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 1.4168530947054436) internal successors, (1900), 1341 states have internal predecessors, (1900), 0 states have call successors, (0), 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-10-31 15:04:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1900 transitions. [2024-10-31 15:04:31,146 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1900 transitions. Word has length 167 [2024-10-31 15:04:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1900 transitions. [2024-10-31 15:04:31,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-10-31 15:04:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1900 transitions. [2024-10-31 15:04:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-31 15:04:31,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:31,151 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:31,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 15:04:31,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:31,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 371238982, now seen corresponding path program 1 times [2024-10-31 15:04:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003221329] [2024-10-31 15:04:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:31,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:31,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-31 15:04:31,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-31 15:04:31,256 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003221329] [2024-10-31 15:04:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2003221329] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:31,257 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283047107] [2024-10-31 15:04:31,257 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:31,258 INFO L87 Difference]: Start difference. First operand 1342 states and 1900 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-10-31 15:04:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:31,314 INFO L93 Difference]: Finished difference Result 2667 states and 3780 transitions. [2024-10-31 15:04:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:31,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-31 15:04:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:31,321 INFO L225 Difference]: With dead ends: 2667 [2024-10-31 15:04:31,321 INFO L226 Difference]: Without dead ends: 1344 [2024-10-31 15:04:31,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-10-31 15:04:31,324 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-10-31 15:04:31,324 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-10-31 15:04:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-10-31 15:04:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2024-10-31 15:04:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.4162323157110945) internal successors, (1902), 1343 states have internal predecessors, (1902), 0 states have call successors, (0), 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-10-31 15:04:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1902 transitions. [2024-10-31 15:04:31,355 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1902 transitions. Word has length 167 [2024-10-31 15:04:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1902 transitions. [2024-10-31 15:04:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-10-31 15:04:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1902 transitions. [2024-10-31 15:04:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-31 15:04:31,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:31,359 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 15:04:31,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1928969459, now seen corresponding path program 1 times [2024-10-31 15:04:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903432669] [2024-10-31 15:04:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:31,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:31,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-31 15:04:31,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-31 15:04:31,518 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903432669] [2024-10-31 15:04:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [903432669] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:31,518 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565972909] [2024-10-31 15:04:31,518 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:31,520 INFO L87 Difference]: Start difference. First operand 1344 states and 1902 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-10-31 15:04:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:31,752 INFO L93 Difference]: Finished difference Result 2791 states and 3991 transitions. [2024-10-31 15:04:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 203 [2024-10-31 15:04:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:31,764 INFO L225 Difference]: With dead ends: 2791 [2024-10-31 15:04:31,764 INFO L226 Difference]: Without dead ends: 1468 [2024-10-31 15:04:31,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 403 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-10-31 15:04:31,767 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:31,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-10-31 15:04:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2024-10-31 15:04:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 1.394683026584867) internal successors, (2046), 1467 states have internal predecessors, (2046), 0 states have call successors, (0), 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-10-31 15:04:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2046 transitions. [2024-10-31 15:04:31,810 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2046 transitions. Word has length 203 [2024-10-31 15:04:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:31,810 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2046 transitions. [2024-10-31 15:04:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-10-31 15:04:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2046 transitions. [2024-10-31 15:04:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-31 15:04:31,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:31,815 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:31,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 15:04:31,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:31,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1353326442, now seen corresponding path program 1 times [2024-10-31 15:04:31,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:31,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795998190] [2024-10-31 15:04:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:31,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 15:04:31,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-31 15:04:31,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-31 15:04:32,026 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795998190] [2024-10-31 15:04:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1795998190] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:32,027 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:04:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907470408] [2024-10-31 15:04:32,027 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:32,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:04:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:32,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:04:32,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:04:32,029 INFO L87 Difference]: Start difference. First operand 1468 states and 2046 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:32,336 INFO L93 Difference]: Finished difference Result 2818 states and 3961 transitions. [2024-10-31 15:04:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:04:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-10-31 15:04:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:32,341 INFO L225 Difference]: With dead ends: 2818 [2024-10-31 15:04:32,342 INFO L226 Difference]: Without dead ends: 1187 [2024-10-31 15:04:32,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 456 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-10-31 15:04:32,345 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:32,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 219 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 15:04:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-10-31 15:04:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2024-10-31 15:04:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.363406408094435) internal successors, (1617), 1186 states have internal predecessors, (1617), 0 states have call successors, (0), 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-10-31 15:04:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1617 transitions. [2024-10-31 15:04:32,374 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1617 transitions. Word has length 230 [2024-10-31 15:04:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1617 transitions. [2024-10-31 15:04:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1617 transitions. [2024-10-31 15:04:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-31 15:04:32,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:32,379 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-31 15:04:32,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 15:04:32,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2024-10-31 15:04:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880294956] [2024-10-31 15:04:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:32,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:32,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-31 15:04:32,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-31 15:04:32,939 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:32,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1880294956] [2024-10-31 15:04:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1880294956] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:32,939 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967375500] [2024-10-31 15:04:32,940 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:32,941 INFO L87 Difference]: Start difference. First operand 1187 states and 1617 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-31 15:04:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:32,980 INFO L93 Difference]: Finished difference Result 3310 states and 4561 transitions. [2024-10-31 15:04:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 269 [2024-10-31 15:04:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:32,986 INFO L225 Difference]: With dead ends: 3310 [2024-10-31 15:04:32,986 INFO L226 Difference]: Without dead ends: 1144 [2024-10-31 15:04:32,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 535 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-10-31 15:04:32,991 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:32,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 454 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:04:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-31 15:04:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-10-31 15:04:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.3674540682414698) internal successors, (1563), 1143 states have internal predecessors, (1563), 0 states have call successors, (0), 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-10-31 15:04:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1563 transitions. [2024-10-31 15:04:33,023 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1563 transitions. Word has length 269 [2024-10-31 15:04:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:33,024 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1563 transitions. [2024-10-31 15:04:33,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-31 15:04:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1563 transitions. [2024-10-31 15:04:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-10-31 15:04:33,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:33,029 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:33,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 15:04:33,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:33,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash 746936446, now seen corresponding path program 1 times [2024-10-31 15:04:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:33,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [244164555] [2024-10-31 15:04:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:33,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:33,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-31 15:04:33,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-31 15:04:33,171 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [244164555] [2024-10-31 15:04:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [244164555] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:33,171 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999782312] [2024-10-31 15:04:33,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:33,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:33,173 INFO L87 Difference]: Start difference. First operand 1144 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:33,334 INFO L93 Difference]: Finished difference Result 2348 states and 3233 transitions. [2024-10-31 15:04:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2024-10-31 15:04:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:33,344 INFO L225 Difference]: With dead ends: 2348 [2024-10-31 15:04:33,344 INFO L226 Difference]: Without dead ends: 1225 [2024-10-31 15:04:33,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 627 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-10-31 15:04:33,346 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:33,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 262 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:04:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-10-31 15:04:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2024-10-31 15:04:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.3553921568627452) internal successors, (1659), 1224 states have internal predecessors, (1659), 0 states have call successors, (0), 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-10-31 15:04:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1659 transitions. [2024-10-31 15:04:33,379 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1659 transitions. Word has length 315 [2024-10-31 15:04:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:33,380 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1659 transitions. [2024-10-31 15:04:33,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1659 transitions. [2024-10-31 15:04:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-31 15:04:33,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:33,385 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 15:04:33,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1865013778, now seen corresponding path program 1 times [2024-10-31 15:04:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374857594] [2024-10-31 15:04:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:33,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:33,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-10-31 15:04:33,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-10-31 15:04:33,545 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374857594] [2024-10-31 15:04:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1374857594] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:33,545 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935375245] [2024-10-31 15:04:33,546 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:33,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:33,549 INFO L87 Difference]: Start difference. First operand 1225 states and 1659 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-10-31 15:04:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:33,717 INFO L93 Difference]: Finished difference Result 2516 states and 3437 transitions. [2024-10-31 15:04:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:33,722 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 338 [2024-10-31 15:04:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:33,727 INFO L225 Difference]: With dead ends: 2516 [2024-10-31 15:04:33,727 INFO L226 Difference]: Without dead ends: 1312 [2024-10-31 15:04:33,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 673 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-10-31 15:04:33,730 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:33,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 262 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:04:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-10-31 15:04:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2024-10-31 15:04:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 1.3432494279176201) internal successors, (1761), 1311 states have internal predecessors, (1761), 0 states have call successors, (0), 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-10-31 15:04:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1761 transitions. [2024-10-31 15:04:33,760 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1761 transitions. Word has length 338 [2024-10-31 15:04:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:33,761 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1761 transitions. [2024-10-31 15:04:33,761 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-10-31 15:04:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1761 transitions. [2024-10-31 15:04:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-31 15:04:33,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:33,766 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:33,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 15:04:33,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:33,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2024-10-31 15:04:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417983322] [2024-10-31 15:04:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:33,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:33,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-10-31 15:04:33,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-10-31 15:04:34,030 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417983322] [2024-10-31 15:04:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1417983322] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:34,030 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487189548] [2024-10-31 15:04:34,030 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:34,032 INFO L87 Difference]: Start difference. First operand 1312 states and 1761 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-31 15:04:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:34,074 INFO L93 Difference]: Finished difference Result 3888 states and 5224 transitions. [2024-10-31 15:04:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 370 [2024-10-31 15:04:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:34,084 INFO L225 Difference]: With dead ends: 3888 [2024-10-31 15:04:34,085 INFO L226 Difference]: Without dead ends: 2597 [2024-10-31 15:04:34,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 737 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-10-31 15:04:34,088 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 121 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:34,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:04:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-31 15:04:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2595. [2024-10-31 15:04:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2594 states have (on average 1.3419429452582883) internal successors, (3481), 2594 states have internal predecessors, (3481), 0 states have call successors, (0), 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-10-31 15:04:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3481 transitions. [2024-10-31 15:04:34,164 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3481 transitions. Word has length 370 [2024-10-31 15:04:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:34,164 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3481 transitions. [2024-10-31 15:04:34,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-31 15:04:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3481 transitions. [2024-10-31 15:04:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-10-31 15:04:34,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:34,172 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 15:04:34,172 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -59651589, now seen corresponding path program 1 times [2024-10-31 15:04:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314749703] [2024-10-31 15:04:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:34,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 15:04:34,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 875 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-31 15:04:34,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 875 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-31 15:04:34,418 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314749703] [2024-10-31 15:04:34,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1314749703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:04:34,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:04:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-10-31 15:04:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686025176] [2024-10-31 15:04:34,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:04:34,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:04:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:04:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:04:34,421 INFO L87 Difference]: Start difference. First operand 2595 states and 3481 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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-10-31 15:04:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:34,738 INFO L93 Difference]: Finished difference Result 7435 states and 9857 transitions. [2024-10-31 15:04:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:04:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 371 [2024-10-31 15:04:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:34,760 INFO L225 Difference]: With dead ends: 7435 [2024-10-31 15:04:34,761 INFO L226 Difference]: Without dead ends: 4861 [2024-10-31 15:04:34,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 15:04:34,766 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 132 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:34,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 571 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2024-10-31 15:04:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3237. [2024-10-31 15:04:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 3236 states have (on average 1.342707045735476) internal successors, (4345), 3236 states have internal predecessors, (4345), 0 states have call successors, (0), 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-10-31 15:04:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4345 transitions. [2024-10-31 15:04:34,910 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4345 transitions. Word has length 371 [2024-10-31 15:04:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:34,910 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 4345 transitions. [2024-10-31 15:04:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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-10-31 15:04:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4345 transitions. [2024-10-31 15:04:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-31 15:04:34,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:34,921 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 15:04:34,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1792598736, now seen corresponding path program 1 times [2024-10-31 15:04:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246251686] [2024-10-31 15:04:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:34,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:34,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-31 15:04:35,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-31 15:04:35,059 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246251686] [2024-10-31 15:04:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246251686] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:35,060 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:35,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727088938] [2024-10-31 15:04:35,060 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:35,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:35,061 INFO L87 Difference]: Start difference. First operand 3237 states and 4345 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-10-31 15:04:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:35,258 INFO L93 Difference]: Finished difference Result 6693 states and 9025 transitions. [2024-10-31 15:04:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 401 [2024-10-31 15:04:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:35,276 INFO L225 Difference]: With dead ends: 6693 [2024-10-31 15:04:35,276 INFO L226 Difference]: Without dead ends: 3477 [2024-10-31 15:04:35,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 799 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-10-31 15:04:35,281 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:35,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 264 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:04:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2024-10-31 15:04:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3357. [2024-10-31 15:04:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.3393921334922527) internal successors, (4495), 3356 states have internal predecessors, (4495), 0 states have call successors, (0), 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-10-31 15:04:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4495 transitions. [2024-10-31 15:04:35,361 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4495 transitions. Word has length 401 [2024-10-31 15:04:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:35,362 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4495 transitions. [2024-10-31 15:04:35,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-10-31 15:04:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4495 transitions. [2024-10-31 15:04:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-31 15:04:35,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:35,368 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 15:04:35,368 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 571180815, now seen corresponding path program 1 times [2024-10-31 15:04:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549276923] [2024-10-31 15:04:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:35,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:35,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 983 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-10-31 15:04:35,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 983 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-10-31 15:04:35,539 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549276923] [2024-10-31 15:04:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1549276923] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:35,540 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909480450] [2024-10-31 15:04:35,540 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:35,543 INFO L87 Difference]: Start difference. First operand 3357 states and 4495 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-10-31 15:04:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:35,742 INFO L93 Difference]: Finished difference Result 7101 states and 9661 transitions. [2024-10-31 15:04:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 402 [2024-10-31 15:04:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:35,766 INFO L225 Difference]: With dead ends: 7101 [2024-10-31 15:04:35,766 INFO L226 Difference]: Without dead ends: 3765 [2024-10-31 15:04:35,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 801 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-10-31 15:04:35,775 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:35,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 262 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-10-31 15:04:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-10-31 15:04:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 1.3185441020191286) internal successors, (4963), 3764 states have internal predecessors, (4963), 0 states have call successors, (0), 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-10-31 15:04:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 4963 transitions. [2024-10-31 15:04:35,871 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 4963 transitions. Word has length 402 [2024-10-31 15:04:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 4963 transitions. [2024-10-31 15:04:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-10-31 15:04:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 4963 transitions. [2024-10-31 15:04:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-31 15:04:35,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:35,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 15:04:35,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1646161403, now seen corresponding path program 1 times [2024-10-31 15:04:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966088577] [2024-10-31 15:04:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:35,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:35,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-10-31 15:04:36,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-10-31 15:04:36,060 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966088577] [2024-10-31 15:04:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1966088577] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:36,061 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109594454] [2024-10-31 15:04:36,061 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:36,063 INFO L87 Difference]: Start difference. First operand 3765 states and 4963 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-10-31 15:04:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:36,320 INFO L93 Difference]: Finished difference Result 7497 states and 9883 transitions. [2024-10-31 15:04:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:36,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 433 [2024-10-31 15:04:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:36,343 INFO L225 Difference]: With dead ends: 7497 [2024-10-31 15:04:36,344 INFO L226 Difference]: Without dead ends: 3753 [2024-10-31 15:04:36,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 863 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-10-31 15:04:36,350 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:36,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 262 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2024-10-31 15:04:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3303. [2024-10-31 15:04:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3302 states have (on average 1.2668079951544517) internal successors, (4183), 3302 states have internal predecessors, (4183), 0 states have call successors, (0), 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-10-31 15:04:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4183 transitions. [2024-10-31 15:04:36,432 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4183 transitions. Word has length 433 [2024-10-31 15:04:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:36,432 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4183 transitions. [2024-10-31 15:04:36,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-10-31 15:04:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4183 transitions. [2024-10-31 15:04:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-10-31 15:04:36,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:36,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:36,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 15:04:36,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 912404788, now seen corresponding path program 1 times [2024-10-31 15:04:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002464616] [2024-10-31 15:04:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:36,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 15:04:36,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 1351 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-10-31 15:04:36,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 1351 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-10-31 15:04:36,620 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002464616] [2024-10-31 15:04:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2002464616] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:04:36,620 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:04:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-10-31 15:04:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066917716] [2024-10-31 15:04:36,621 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:04:36,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 15:04:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 15:04:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 15:04:36,622 INFO L87 Difference]: Start difference. First operand 3303 states and 4183 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:36,850 INFO L93 Difference]: Finished difference Result 6411 states and 8081 transitions. [2024-10-31 15:04:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:04:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2024-10-31 15:04:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:36,857 INFO L225 Difference]: With dead ends: 6411 [2024-10-31 15:04:36,857 INFO L226 Difference]: Without dead ends: 3129 [2024-10-31 15:04:36,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 929 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-10-31 15:04:36,862 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:36,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:04:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2024-10-31 15:04:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3117. [2024-10-31 15:04:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 3116 states have (on average 1.2102053915275994) internal successors, (3771), 3116 states have internal predecessors, (3771), 0 states have call successors, (0), 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-10-31 15:04:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 3771 transitions. [2024-10-31 15:04:36,956 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 3771 transitions. Word has length 466 [2024-10-31 15:04:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:36,956 INFO L471 AbstractCegarLoop]: Abstraction has 3117 states and 3771 transitions. [2024-10-31 15:04:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:04:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 3771 transitions. [2024-10-31 15:04:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-31 15:04:36,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:04:36,962 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 15:04:36,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 15:04:36,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:04:36,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:04:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 325769247, now seen corresponding path program 1 times [2024-10-31 15:04:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:04:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [104698619] [2024-10-31 15:04:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:04:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:04:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:04:37,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 15:04:37,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:04:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 1308 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2024-10-31 15:04:37,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:04:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 1308 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2024-10-31 15:04:37,282 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:04:37,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [104698619] [2024-10-31 15:04:37,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [104698619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:04:37,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:04:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-31 15:04:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550599380] [2024-10-31 15:04:37,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:04:37,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 15:04:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:04:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 15:04:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 15:04:37,284 INFO L87 Difference]: Start difference. First operand 3117 states and 3771 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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-10-31 15:04:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:04:37,732 INFO L93 Difference]: Finished difference Result 4438 states and 5392 transitions. [2024-10-31 15:04:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 15:04:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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 504 [2024-10-31 15:04:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:04:37,736 INFO L225 Difference]: With dead ends: 4438 [2024-10-31 15:04:37,736 INFO L226 Difference]: Without dead ends: 0 [2024-10-31 15:04:37,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-31 15:04:37,742 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 146 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 15:04:37,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 662 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 15:04:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-31 15:04:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-31 15:04:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10-31 15:04:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-31 15:04:37,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 504 [2024-10-31 15:04:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:04:37,744 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 15:04:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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-10-31 15:04:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-31 15:04:37,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-31 15:04:37,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 15:04:37,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 15:04:37,750 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:04:37,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-31 15:04:38,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 15:04:38,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 03:04:38 BoogieIcfgContainer [2024-10-31 15:04:38,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 15:04:38,811 INFO L158 Benchmark]: Toolchain (without parser) took 13505.73ms. Allocated memory was 181.4MB in the beginning and 394.3MB in the end (delta: 212.9MB). Free memory was 156.5MB in the beginning and 207.4MB in the end (delta: -50.9MB). Peak memory consumption was 194.4MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,811 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 158.0MB in the beginning and 158.0MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-10-31 15:04:38,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.89ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 138.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.47ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 135.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,811 INFO L158 Benchmark]: Boogie Preprocessor took 83.04ms. Allocated memory is still 181.4MB. Free memory was 135.0MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,812 INFO L158 Benchmark]: RCFGBuilder took 879.07ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 131.9MB in the beginning and 194.0MB in the end (delta: -62.1MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,812 INFO L158 Benchmark]: TraceAbstraction took 12038.43ms. Allocated memory was 218.1MB in the beginning and 394.3MB in the end (delta: 176.2MB). Free memory was 192.9MB in the beginning and 207.4MB in the end (delta: -14.5MB). Peak memory consumption was 193.6MB. Max. memory is 8.0GB. [2024-10-31 15:04:38,816 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 158.0MB in the beginning and 158.0MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.89ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 138.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.47ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 135.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.04ms. Allocated memory is still 181.4MB. Free memory was 135.0MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 879.07ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 131.9MB in the beginning and 194.0MB in the end (delta: -62.1MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12038.43ms. Allocated memory was 218.1MB in the beginning and 394.3MB in the end (delta: 176.2MB). Free memory was 192.9MB in the beginning and 207.4MB in the end (delta: -14.5MB). Peak memory consumption was 193.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 678]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1242 mSDsluCounter, 7451 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3224 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2515 IncrementalHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 4227 mSDtfsCounter, 2515 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10774 GetRequests, 10739 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3765occurred in iteration=19, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 2224 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5404 NumberOfCodeBlocks, 5404 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10764 ConstructedInterpolants, 0 QuantifiedInterpolants, 14744 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6195 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 44 InterpolantComputations, 40 PerfectInterpolantSequences, 35446/35550 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag == 2) && (8466 == s__state)) && (s__s3__tmp__next_state___0 != 8640)) || ((blastFlag == 2) && (8512 == s__state))) || (((8448 == s__state) && (blastFlag == 2)) && (s__s3__tmp__next_state___0 == 8576))) || ((blastFlag != 4) && (0 != s__hit))) || ((blastFlag == 2) && (8560 == s__state))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 != 8640)) && (8592 == s__state))) || (((8448 == s__state) && (s__s3__tmp__next_state___0 == 3)) && (blastFlag == 3))) || ((blastFlag == 0) && (8464 == s__state))) || ((8672 == s__state) && (blastFlag == 3))) || ((blastFlag == 2) && (8640 == s__state))) || ((blastFlag == 1) && (8496 == s__state))) || (((blastFlag == 2) && (8608 == s__state)) && (s__s3__tmp__next_state___0 != 8640))) || (3 == s__state)) || ((blastFlag == 2) && (8544 == s__state))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 != 8640)) && (8496 == s__state))) || ((blastFlag == 2) && (8528 == s__state))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 == 8576)) && (8576 == s__state))) || ((blastFlag == 2) && (8656 == s__state))) RESULT: Ultimate proved your program to be correct! [2024-10-31 15:04:38,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...