/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-10-31 15:02:51,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 15:02:51,663 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:02:51,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 15:02:51,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 15:02:51,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 15:02:51,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 15:02:51,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 15:02:51,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 15:02:51,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 15:02:51,703 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 15:02:51,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 15:02:51,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 15:02:51,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 15:02:51,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 15:02:51,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 15:02:51,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 15:02:51,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 15:02:51,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 15:02:51,706 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 15:02:51,706 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 15:02:51,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 15:02:51,709 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 15:02:51,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 15:02:51,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 15:02:51,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 15:02:51,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 15:02:51,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 15:02:51,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 15:02:51,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 15:02:51,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:02:51,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 15:02:51,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 15:02:51,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 15:02:51,715 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 15:02:51,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 15:02:51,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 15:02:51,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 15:02:51,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 15:02:51,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 15:02:51,716 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 15:02:51,717 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:02:52,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 15:02:52,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 15:02:52,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 15:02:52,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 15:02:52,039 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 15:02:52,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2024-10-31 15:02:53,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 15:02:53,684 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 15:02:53,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2024-10-31 15:02:53,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24356498/18d912457a244e159932d1858d868795/FLAGbd20cf3f4 [2024-10-31 15:02:53,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24356498/18d912457a244e159932d1858d868795 [2024-10-31 15:02:53,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 15:02:53,720 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-31 15:02:53,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 15:02:53,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 15:02:53,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 15:02:53,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:02:53" (1/1) ... [2024-10-31 15:02:53,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609385dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:53, skipping insertion in model container [2024-10-31 15:02:53,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:02:53" (1/1) ... [2024-10-31 15:02:53,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 15:02:53,938 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/byte_add-1.i[1166,1179] [2024-10-31 15:02:53,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:02:54,003 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 15:02:54,018 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/byte_add-1.i[1166,1179] [2024-10-31 15:02:54,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:02:54,063 INFO L204 MainTranslator]: Completed translation [2024-10-31 15:02:54,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54 WrapperNode [2024-10-31 15:02:54,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 15:02:54,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 15:02:54,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 15:02:54,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 15:02:54,073 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:02:54" (1/1) ... [2024-10-31 15:02:54,081 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:02:54" (1/1) ... [2024-10-31 15:02:54,105 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2024-10-31 15:02:54,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 15:02:54,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 15:02:54,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 15:02:54,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 15:02:54,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,135 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:02:54,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 15:02:54,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 15:02:54,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 15:02:54,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 15:02:54,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:02:54,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-31 15:02:54,195 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:02:54,198 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:02:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 15:02:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 15:02:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 15:02:54,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 15:02:54,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 15:02:54,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 15:02:54,613 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-31 15:02:54,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 15:02:54,631 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 15:02:54,633 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 15:02:54,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:02:54 BoogieIcfgContainer [2024-10-31 15:02:54,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 15:02:54,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 15:02:54,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 15:02:54,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 15:02:54,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 03:02:53" (1/3) ... [2024-10-31 15:02:54,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e82ac07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:02:54, skipping insertion in model container [2024-10-31 15:02:54,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (2/3) ... [2024-10-31 15:02:54,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e82ac07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:02:54, skipping insertion in model container [2024-10-31 15:02:54,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:02:54" (3/3) ... [2024-10-31 15:02:54,643 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-10-31 15:02:54,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 15:02:54,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 15:02:54,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 15:02:54,733 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;@1b4a1b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 15:02:54,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 15:02:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 15:02:54,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:54,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:54,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:54,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-10-31 15:02:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:54,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989330233] [2024-10-31 15:02:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:54,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 15:02:54,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:54,957 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:02:54,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:54,963 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:02:54,964 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989330233] [2024-10-31 15:02:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1989330233] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:54,965 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:54,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-10-31 15:02:54,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538556792] [2024-10-31 15:02:54,968 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:54,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 15:02:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 15:02:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 15:02:54,997 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:55,015 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-10-31 15:02:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 15:02:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-31 15:02:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:55,024 INFO L225 Difference]: With dead ends: 57 [2024-10-31 15:02:55,024 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 15:02:55,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 15:02:55,032 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:55,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:02:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 15:02:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 15:02:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-10-31 15:02:55,067 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-10-31 15:02:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:55,067 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-10-31 15:02:55,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-10-31 15:02:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 15:02:55,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:55,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:55,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 15:02:55,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-10-31 15:02:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605758506] [2024-10-31 15:02:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:55,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 15:02:55,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:55,630 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:02:55,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:55,659 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:02:55,660 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:55,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605758506] [2024-10-31 15:02:55,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [605758506] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:55,660 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:02:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684280114] [2024-10-31 15:02:55,661 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:02:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:55,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:02:55,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:02:55,664 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:55,902 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-10-31 15:02:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:02:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-31 15:02:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:55,905 INFO L225 Difference]: With dead ends: 107 [2024-10-31 15:02:55,905 INFO L226 Difference]: Without dead ends: 79 [2024-10-31 15:02:55,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:02:55,906 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 60 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:55,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 61 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:02:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-31 15:02:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2024-10-31 15:02:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 62 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-10-31 15:02:55,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 12 [2024-10-31 15:02:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:55,921 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-10-31 15:02:55,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-10-31 15:02:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 15:02:55,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:55,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 15:02:55,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -235076041, now seen corresponding path program 1 times [2024-10-31 15:02:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991546806] [2024-10-31 15:02:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:56,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:02:56,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 15:02:56,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 15:02:56,168 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991546806] [2024-10-31 15:02:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [991546806] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:56,169 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2024-10-31 15:02:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970875634] [2024-10-31 15:02:56,173 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 15:02:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 15:02:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 15:02:56,174 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:56,399 INFO L93 Difference]: Finished difference Result 150 states and 239 transitions. [2024-10-31 15:02:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 15:02:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 15:02:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:56,401 INFO L225 Difference]: With dead ends: 150 [2024-10-31 15:02:56,401 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 15:02:56,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-31 15:02:56,402 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:56,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 70 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:02:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 15:02:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-10-31 15:02:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 97 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2024-10-31 15:02:56,413 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 24 [2024-10-31 15:02:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2024-10-31 15:02:56,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2024-10-31 15:02:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 15:02:56,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:56,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:56,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 15:02:56,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 730584695, now seen corresponding path program 1 times [2024-10-31 15:02:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920471386] [2024-10-31 15:02:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:56,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:02:56,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-31 15:02:56,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 15:02:56,705 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920471386] [2024-10-31 15:02:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1920471386] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:56,705 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-10-31 15:02:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605659005] [2024-10-31 15:02:56,706 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:56,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 15:02:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 15:02:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 15:02:56,709 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:57,036 INFO L93 Difference]: Finished difference Result 351 states and 521 transitions. [2024-10-31 15:02:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 15:02:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 15:02:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:57,040 INFO L225 Difference]: With dead ends: 351 [2024-10-31 15:02:57,040 INFO L226 Difference]: Without dead ends: 260 [2024-10-31 15:02:57,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-31 15:02:57,042 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:57,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 156 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 15:02:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-31 15:02:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 182. [2024-10-31 15:02:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4364640883977902) internal successors, (260), 181 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2024-10-31 15:02:57,071 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 24 [2024-10-31 15:02:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2024-10-31 15:02:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2024-10-31 15:02:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 15:02:57,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:57,073 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 15:02:57,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1578156322, now seen corresponding path program 1 times [2024-10-31 15:02:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942214741] [2024-10-31 15:02:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:57,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 15:02:57,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-31 15:02:57,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 15:02:57,362 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942214741] [2024-10-31 15:02:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1942214741] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:57,364 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-10-31 15:02:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363597716] [2024-10-31 15:02:57,365 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:57,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 15:02:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 15:02:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 15:02:57,366 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:57,661 INFO L93 Difference]: Finished difference Result 658 states and 945 transitions. [2024-10-31 15:02:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 15:02:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-31 15:02:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:57,664 INFO L225 Difference]: With dead ends: 658 [2024-10-31 15:02:57,664 INFO L226 Difference]: Without dead ends: 492 [2024-10-31 15:02:57,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-31 15:02:57,667 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:57,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 191 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:02:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-31 15:02:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 430. [2024-10-31 15:02:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 429 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 609 transitions. [2024-10-31 15:02:57,720 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 609 transitions. Word has length 26 [2024-10-31 15:02:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 609 transitions. [2024-10-31 15:02:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 609 transitions. [2024-10-31 15:02:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 15:02:57,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:57,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:57,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 15:02:57,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:57,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1110801003, now seen corresponding path program 1 times [2024-10-31 15:02:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620975469] [2024-10-31 15:02:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:57,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-31 15:02:57,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-31 15:02:58,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 15:02:58,113 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620975469] [2024-10-31 15:02:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [620975469] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:58,114 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 13 [2024-10-31 15:02:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290595132] [2024-10-31 15:02:58,114 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 15:02:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 15:02:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-31 15:02:58,115 INFO L87 Difference]: Start difference. First operand 430 states and 609 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:58,613 INFO L93 Difference]: Finished difference Result 1019 states and 1467 transitions. [2024-10-31 15:02:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 15:02:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-31 15:02:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:58,617 INFO L225 Difference]: With dead ends: 1019 [2024-10-31 15:02:58,617 INFO L226 Difference]: Without dead ends: 812 [2024-10-31 15:02:58,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-31 15:02:58,619 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 440 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:58,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 546 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 15:02:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-31 15:02:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 780. [2024-10-31 15:02:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.4094993581514763) internal successors, (1098), 779 states have internal predecessors, (1098), 0 states have call successors, (0), 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:02:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1098 transitions. [2024-10-31 15:02:58,644 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1098 transitions. Word has length 28 [2024-10-31 15:02:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:58,645 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1098 transitions. [2024-10-31 15:02:58,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1098 transitions. [2024-10-31 15:02:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 15:02:58,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:58,647 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] [2024-10-31 15:02:58,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 15:02:58,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:58,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2082362030, now seen corresponding path program 1 times [2024-10-31 15:02:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985940370] [2024-10-31 15:02:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:58,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 15:02:58,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:02:58,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:02:58,771 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985940370] [2024-10-31 15:02:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1985940370] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:58,771 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:02:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488210049] [2024-10-31 15:02:58,771 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:58,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:02:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:02:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:02:58,773 INFO L87 Difference]: Start difference. First operand 780 states and 1098 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:58,800 INFO L93 Difference]: Finished difference Result 1099 states and 1513 transitions. [2024-10-31 15:02:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:02:58,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-31 15:02:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:58,805 INFO L225 Difference]: With dead ends: 1099 [2024-10-31 15:02:58,806 INFO L226 Difference]: Without dead ends: 1077 [2024-10-31 15:02:58,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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:02:58,807 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:58,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:02:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-10-31 15:02:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 991. [2024-10-31 15:02:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3838383838383839) internal successors, (1370), 990 states have internal predecessors, (1370), 0 states have call successors, (0), 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:02:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1370 transitions. [2024-10-31 15:02:58,838 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1370 transitions. Word has length 34 [2024-10-31 15:02:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:58,838 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1370 transitions. [2024-10-31 15:02:58,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1370 transitions. [2024-10-31 15:02:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 15:02:58,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:58,841 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] [2024-10-31 15:02:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 15:02:58,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:58,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash 218460560, now seen corresponding path program 1 times [2024-10-31 15:02:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568558911] [2024-10-31 15:02:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:59,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-31 15:02:59,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:02:59,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:59,427 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568558911] [2024-10-31 15:02:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [568558911] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:59,428 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 15 [2024-10-31 15:02:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370330552] [2024-10-31 15:02:59,428 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-31 15:02:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-31 15:02:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-31 15:02:59,429 INFO L87 Difference]: Start difference. First operand 991 states and 1370 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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:03:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:00,622 INFO L93 Difference]: Finished difference Result 2442 states and 3378 transitions. [2024-10-31 15:03:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-31 15:03:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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 34 [2024-10-31 15:03:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:00,628 INFO L225 Difference]: With dead ends: 2442 [2024-10-31 15:03:00,628 INFO L226 Difference]: Without dead ends: 1504 [2024-10-31 15:03:00,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=642, Unknown=0, NotChecked=0, Total=992 [2024-10-31 15:03:00,630 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 933 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:00,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 322 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 15:03:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-10-31 15:03:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1297. [2024-10-31 15:03:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1296 states have (on average 1.3209876543209877) internal successors, (1712), 1296 states have internal predecessors, (1712), 0 states have call successors, (0), 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:03:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1712 transitions. [2024-10-31 15:03:00,675 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1712 transitions. Word has length 34 [2024-10-31 15:03:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:00,675 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1712 transitions. [2024-10-31 15:03:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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:03:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1712 transitions. [2024-10-31 15:03:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 15:03:00,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:00,679 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] [2024-10-31 15:03:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 15:03:00,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1990369840, now seen corresponding path program 1 times [2024-10-31 15:03:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796534584] [2024-10-31 15:03:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:00,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:03:00,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:03:00,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:03:00,789 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796534584] [2024-10-31 15:03:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796534584] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:03:00,789 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:03:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:03:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45535232] [2024-10-31 15:03:00,790 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:03:00,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:03:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:03:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:03:00,791 INFO L87 Difference]: Start difference. First operand 1297 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:00,937 INFO L93 Difference]: Finished difference Result 2783 states and 3665 transitions. [2024-10-31 15:03:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:03:00,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-31 15:03:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:00,944 INFO L225 Difference]: With dead ends: 2783 [2024-10-31 15:03:00,945 INFO L226 Difference]: Without dead ends: 1545 [2024-10-31 15:03:00,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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:03:00,948 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:00,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 15:03:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-10-31 15:03:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1326. [2024-10-31 15:03:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 1.2883018867924527) internal successors, (1707), 1325 states have internal predecessors, (1707), 0 states have call successors, (0), 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:03:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1707 transitions. [2024-10-31 15:03:01,031 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1707 transitions. Word has length 34 [2024-10-31 15:03:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1707 transitions. [2024-10-31 15:03:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1707 transitions. [2024-10-31 15:03:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 15:03:01,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:01,038 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] [2024-10-31 15:03:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 15:03:01,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -215362478, now seen corresponding path program 1 times [2024-10-31 15:03:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518367768] [2024-10-31 15:03:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:01,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 15:03:01,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:03:01,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:03:01,639 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:01,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518367768] [2024-10-31 15:03:01,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [518367768] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-31 15:03:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 15:03:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2024-10-31 15:03:01,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742609] [2024-10-31 15:03:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 15:03:01,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 15:03:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 15:03:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-31 15:03:01,641 INFO L87 Difference]: Start difference. First operand 1326 states and 1707 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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:03:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:02,225 INFO L93 Difference]: Finished difference Result 2114 states and 2686 transitions. [2024-10-31 15:03:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 15:03:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-31 15:03:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:02,231 INFO L225 Difference]: With dead ends: 2114 [2024-10-31 15:03:02,231 INFO L226 Difference]: Without dead ends: 1649 [2024-10-31 15:03:02,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2024-10-31 15:03:02,232 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 432 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:02,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 146 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 15:03:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-10-31 15:03:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1319. [2024-10-31 15:03:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.282245827010622) internal successors, (1690), 1318 states have internal predecessors, (1690), 0 states have call successors, (0), 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:03:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1690 transitions. [2024-10-31 15:03:02,273 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1690 transitions. Word has length 34 [2024-10-31 15:03:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:02,273 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1690 transitions. [2024-10-31 15:03:02,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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:03:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1690 transitions. [2024-10-31 15:03:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 15:03:02,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:02,275 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] [2024-10-31 15:03:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 15:03:02,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1495250830, now seen corresponding path program 1 times [2024-10-31 15:03:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100954759] [2024-10-31 15:03:02,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:02,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 15:03:02,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 15:03:02,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:03:02,850 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100954759] [2024-10-31 15:03:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [100954759] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:03:02,851 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:03:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 17 [2024-10-31 15:03:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525942450] [2024-10-31 15:03:02,851 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:03:02,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-31 15:03:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-31 15:03:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-31 15:03:02,852 INFO L87 Difference]: Start difference. First operand 1319 states and 1690 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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:03:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:04,234 INFO L93 Difference]: Finished difference Result 2956 states and 3773 transitions. [2024-10-31 15:03:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-31 15:03:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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 34 [2024-10-31 15:03:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:04,243 INFO L225 Difference]: With dead ends: 2956 [2024-10-31 15:03:04,244 INFO L226 Difference]: Without dead ends: 2075 [2024-10-31 15:03:04,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2024-10-31 15:03:04,247 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1463 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:04,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 450 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 15:03:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2024-10-31 15:03:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1275. [2024-10-31 15:03:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.251177394034537) internal successors, (1594), 1274 states have internal predecessors, (1594), 0 states have call successors, (0), 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:03:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1594 transitions. [2024-10-31 15:03:04,314 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1594 transitions. Word has length 34 [2024-10-31 15:03:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:04,315 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1594 transitions. [2024-10-31 15:03:04,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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:03:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1594 transitions. [2024-10-31 15:03:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 15:03:04,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:04,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:03:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 15:03:04,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -645546130, now seen corresponding path program 1 times [2024-10-31 15:03:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591424753] [2024-10-31 15:03:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:04,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 15:03:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-31 15:03:04,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 15:03:04,656 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:04,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591424753] [2024-10-31 15:03:04,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [591424753] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-31 15:03:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 15:03:04,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-31 15:03:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201035856] [2024-10-31 15:03:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 15:03:04,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 15:03:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 15:03:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-31 15:03:04,658 INFO L87 Difference]: Start difference. First operand 1275 states and 1594 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:04,894 INFO L93 Difference]: Finished difference Result 1601 states and 2000 transitions. [2024-10-31 15:03:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 15:03:04,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-31 15:03:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:04,904 INFO L225 Difference]: With dead ends: 1601 [2024-10-31 15:03:04,904 INFO L226 Difference]: Without dead ends: 1451 [2024-10-31 15:03:04,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-31 15:03:04,906 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:04,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 417 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:03:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-10-31 15:03:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1275. [2024-10-31 15:03:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.251177394034537) internal successors, (1594), 1274 states have internal predecessors, (1594), 0 states have call successors, (0), 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:03:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1594 transitions. [2024-10-31 15:03:04,957 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1594 transitions. Word has length 36 [2024-10-31 15:03:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:04,958 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1594 transitions. [2024-10-31 15:03:04,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1594 transitions. [2024-10-31 15:03:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 15:03:04,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:04,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:03:04,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 15:03:04,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:04,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash -668178384, now seen corresponding path program 1 times [2024-10-31 15:03:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:04,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750750738] [2024-10-31 15:03:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:05,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 15:03:05,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-31 15:03:05,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 15:03:05,359 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750750738] [2024-10-31 15:03:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [750750738] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-31 15:03:05,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 15:03:05,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-31 15:03:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121633687] [2024-10-31 15:03:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 15:03:05,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 15:03:05,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:05,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 15:03:05,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-31 15:03:05,361 INFO L87 Difference]: Start difference. First operand 1275 states and 1594 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:05,616 INFO L93 Difference]: Finished difference Result 1527 states and 1905 transitions. [2024-10-31 15:03:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 15:03:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-31 15:03:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:05,621 INFO L225 Difference]: With dead ends: 1527 [2024-10-31 15:03:05,621 INFO L226 Difference]: Without dead ends: 1373 [2024-10-31 15:03:05,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-31 15:03:05,622 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 238 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:05,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 516 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:03:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-31 15:03:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1279. [2024-10-31 15:03:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.2464788732394365) internal successors, (1593), 1278 states have internal predecessors, (1593), 0 states have call successors, (0), 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:03:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1593 transitions. [2024-10-31 15:03:05,668 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1593 transitions. Word has length 36 [2024-10-31 15:03:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:05,668 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1593 transitions. [2024-10-31 15:03:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1593 transitions. [2024-10-31 15:03:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 15:03:05,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:05,671 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] [2024-10-31 15:03:05,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 15:03:05,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1154382336, now seen corresponding path program 1 times [2024-10-31 15:03:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:05,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215997910] [2024-10-31 15:03:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:05,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:03:05,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:03:05,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:03:05,900 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215997910] [2024-10-31 15:03:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1215997910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:03:05,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:03:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-31 15:03:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181158683] [2024-10-31 15:03:05,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:03:05,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 15:03:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 15:03:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-31 15:03:05,902 INFO L87 Difference]: Start difference. First operand 1279 states and 1593 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:06,227 INFO L93 Difference]: Finished difference Result 3630 states and 4687 transitions. [2024-10-31 15:03:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 15:03:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-31 15:03:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:06,234 INFO L225 Difference]: With dead ends: 3630 [2024-10-31 15:03:06,234 INFO L226 Difference]: Without dead ends: 1876 [2024-10-31 15:03:06,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-31 15:03:06,237 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:06,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 96 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:03:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-10-31 15:03:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1515. [2024-10-31 15:03:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 1.2932628797886394) internal successors, (1958), 1514 states have internal predecessors, (1958), 0 states have call successors, (0), 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:03:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1958 transitions. [2024-10-31 15:03:06,295 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1958 transitions. Word has length 37 [2024-10-31 15:03:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1958 transitions. [2024-10-31 15:03:06,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1958 transitions. [2024-10-31 15:03:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-31 15:03:06,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:06,297 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-31 15:03:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 15:03:06,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2126140849, now seen corresponding path program 1 times [2024-10-31 15:03:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961103511] [2024-10-31 15:03:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:06,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 15:03:06,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-31 15:03:06,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-31 15:03:06,659 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961103511] [2024-10-31 15:03:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [961103511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:03:06,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:03:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2024-10-31 15:03:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713218298] [2024-10-31 15:03:06,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:03:06,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 15:03:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 15:03:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-31 15:03:06,661 INFO L87 Difference]: Start difference. First operand 1515 states and 1958 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:08,049 INFO L93 Difference]: Finished difference Result 5850 states and 7677 transitions. [2024-10-31 15:03:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-31 15:03:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-31 15:03:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:08,062 INFO L225 Difference]: With dead ends: 5850 [2024-10-31 15:03:08,062 INFO L226 Difference]: Without dead ends: 4620 [2024-10-31 15:03:08,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=824, Unknown=0, NotChecked=0, Total=1190 [2024-10-31 15:03:08,064 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 531 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:08,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 344 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 15:03:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2024-10-31 15:03:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3480. [2024-10-31 15:03:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3479 states have (on average 1.313595860879563) internal successors, (4570), 3479 states have internal predecessors, (4570), 0 states have call successors, (0), 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:03:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4570 transitions. [2024-10-31 15:03:08,208 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4570 transitions. Word has length 50 [2024-10-31 15:03:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 3480 states and 4570 transitions. [2024-10-31 15:03:08,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4570 transitions. [2024-10-31 15:03:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 15:03:08,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:08,210 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-31 15:03:08,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 15:03:08,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:08,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2024-10-31 15:03:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544236875] [2024-10-31 15:03:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:03:11,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-31 15:03:11,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:03:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 15:03:13,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:03:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 15:03:15,304 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:03:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544236875] [2024-10-31 15:03:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [544236875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:03:15,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:03:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2024-10-31 15:03:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559638362] [2024-10-31 15:03:15,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:03:15,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-31 15:03:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:03:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-31 15:03:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2024-10-31 15:03:15,306 INFO L87 Difference]: Start difference. First operand 3480 states and 4570 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:03:28,489 INFO L93 Difference]: Finished difference Result 6735 states and 8989 transitions. [2024-10-31 15:03:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-31 15:03:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-31 15:03:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:03:28,506 INFO L225 Difference]: With dead ends: 6735 [2024-10-31 15:03:28,506 INFO L226 Difference]: Without dead ends: 6163 [2024-10-31 15:03:28,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3148, Invalid=10894, Unknown=0, NotChecked=0, Total=14042 [2024-10-31 15:03:28,511 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1949 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 5137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 5137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-31 15:03:28,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5009 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 5137 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-31 15:03:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6163 states. [2024-10-31 15:03:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 4459. [2024-10-31 15:03:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4459 states, 4458 states have (on average 1.3308658591296545) internal successors, (5933), 4458 states have internal predecessors, (5933), 0 states have call successors, (0), 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:03:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5933 transitions. [2024-10-31 15:03:28,799 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5933 transitions. Word has length 51 [2024-10-31 15:03:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:03:28,800 INFO L471 AbstractCegarLoop]: Abstraction has 4459 states and 5933 transitions. [2024-10-31 15:03:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:03:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5933 transitions. [2024-10-31 15:03:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 15:03:28,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:03:28,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:03:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 15:03:28,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:03:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:03:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2024-10-31 15:03:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:03:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2086330574] [2024-10-31 15:03:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:03:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:03:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 15:03:34,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 15:03:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 15:03:38,069 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-10-31 15:03:38,069 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 15:03:38,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 15:03:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 15:03:38,075 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:03:38,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 15:03:38,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 03:03:38 BoogieIcfgContainer [2024-10-31 15:03:38,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 15:03:38,123 INFO L158 Benchmark]: Toolchain (without parser) took 44403.65ms. Allocated memory was 186.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 145.8MB in the beginning and 962.2MB in the end (delta: -816.3MB). Peak memory consumption was 995.6MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,123 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-10-31 15:03:38,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.45ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 130.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.86ms. Allocated memory is still 186.6MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,124 INFO L158 Benchmark]: Boogie Preprocessor took 54.14ms. Allocated memory is still 186.6MB. Free memory was 129.1MB in the beginning and 126.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,124 INFO L158 Benchmark]: RCFGBuilder took 472.59ms. Allocated memory is still 186.6MB. Free memory was 126.5MB in the beginning and 108.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,124 INFO L158 Benchmark]: TraceAbstraction took 43485.90ms. Allocated memory was 186.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.6MB in the beginning and 962.2MB in the end (delta: -854.6MB). Peak memory consumption was 957.9MB. Max. memory is 8.0GB. [2024-10-31 15:03:38,125 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.45ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 130.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.86ms. Allocated memory is still 186.6MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.14ms. Allocated memory is still 186.6MB. Free memory was 129.1MB in the beginning and 126.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 472.59ms. Allocated memory is still 186.6MB. Free memory was 126.5MB in the beginning and 108.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 43485.90ms. Allocated memory was 186.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.6MB in the beginning and 962.2MB in the end (delta: -854.6MB). Peak memory consumption was 957.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L89] COND TRUE i < nb VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=4, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=511, a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, partial_sum=1] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6856 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6856 mSDsluCounter, 8597 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7267 mSDsCounter, 569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10935 IncrementalHoareTripleChecker+Invalid, 11504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 569 mSolverCounterUnsat, 1330 mSDtfsCounter, 10935 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 829 SyntacticMatches, 4 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3625 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4459occurred in iteration=16, InterpolantAutomatonStates: 265, 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, 16 MinimizatonAttempts, 5309 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 11.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 980 ConstructedInterpolants, 18 QuantifiedInterpolants, 7395 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1055 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 188/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-31 15:03:38,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...