/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/num_conversion_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:54:52,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:54:52,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-02 19:54:52,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:54:52,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:54:52,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:54:52,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:54:52,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:54:52,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:54:52,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:54:52,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:54:52,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:54:52,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:54:52,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:54:52,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:54:52,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:54:52,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:54:52,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:54:52,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:54:52,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:54:52,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:54:52,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:54:52,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:54:52,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:54:52,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:54:52,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:54:52,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:54:52,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:54:52,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:54:52,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:54:52,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:54:52,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:54:52,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:54:52,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:54:52,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:52,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:54:52,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:54:52,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:54:52,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:54:52,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:54:52,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:54:52,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:54:52,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:54:52,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:54:52,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol [2024-11-02 19:54:52,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:54:52,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:54:52,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:54:52,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:54:52,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:54:52,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_2.c [2024-11-02 19:54:53,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:54:54,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:54:54,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c [2024-11-02 19:54:54,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aed264d/f6fe670e649140c2a615513a1cc74903/FLAG3adf8b274 [2024-11-02 19:54:54,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aed264d/f6fe670e649140c2a615513a1cc74903 [2024-11-02 19:54:54,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:54:54,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:54:54,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:54,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:54:54,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:54:54,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20742089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54, skipping insertion in model container [2024-11-02 19:54:54,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:54:54,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698] [2024-11-02 19:54:54,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:54,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:54:54,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698] [2024-11-02 19:54:54,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:54,767 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:54:54,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54 WrapperNode [2024-11-02 19:54:54,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:54,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:54,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:54:54,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:54:54,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,797 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-02 19:54:54,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:54,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:54:54,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:54:54,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:54:54,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-02 19:54:54,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:54:54,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:54:54,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:54:54,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:54:54,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (1/1) ... [2024-11-02 19:54:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:54,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:54:54,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-02 19:54:54,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-02 19:54:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:54:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:54:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:54:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:54:54,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:54:54,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:54:55,108 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-02 19:54:55,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:54:55,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:54:55,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 19:54:55,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:55 BoogieIcfgContainer [2024-11-02 19:54:55,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:54:55,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:54:55,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:54:55,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:54:55,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:54:54" (1/3) ... [2024-11-02 19:54:55,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccefbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:55, skipping insertion in model container [2024-11-02 19:54:55,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:54" (2/3) ... [2024-11-02 19:54:55,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccefbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:55, skipping insertion in model container [2024-11-02 19:54:55,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:55" (3/3) ... [2024-11-02 19:54:55,132 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2024-11-02 19:54:55,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:54:55,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:54:55,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:54:55,215 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;@78b13786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:54:55,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:54:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 19:54:55,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:55,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 19:54:55,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-02 19:54:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:55,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797541161] [2024-11-02 19:54:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:55,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-02 19:54:55,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:55,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:55,380 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797541161] [2024-11-02 19:54:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1797541161] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:55,381 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-02 19:54:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854040053] [2024-11-02 19:54:55,383 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 19:54:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 19:54:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:55,408 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:55,420 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-02 19:54:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 19:54:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-02 19:54:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:55,430 INFO L225 Difference]: With dead ends: 21 [2024-11-02 19:54:55,431 INFO L226 Difference]: Without dead ends: 9 [2024-11-02 19:54:55,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:55,438 INFO L432 NwaCegarLoop]: 14 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, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:55,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-02 19:54:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-02 19:54:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-02 19:54:55,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-02 19:54:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:55,467 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-02 19:54:55,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-02 19:54:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 19:54:55,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:55,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 19:54:55,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:54:55,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-02 19:54:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1438300258] [2024-11-02 19:54:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:55,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:54:55,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:55,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:55,621 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1438300258] [2024-11-02 19:54:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1438300258] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:55,622 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986605828] [2024-11-02 19:54:55,622 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:55,624 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:55,647 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-02 19:54:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 6 [2024-11-02 19:54:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:55,648 INFO L225 Difference]: With dead ends: 17 [2024-11-02 19:54:55,648 INFO L226 Difference]: Without dead ends: 13 [2024-11-02 19:54:55,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:55,650 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:55,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-02 19:54:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-02 19:54:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-02 19:54:55,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2024-11-02 19:54:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-02 19:54:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-02 19:54:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:55,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:55,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:54:55,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 1 times [2024-11-02 19:54:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733727111] [2024-11-02 19:54:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:56,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:56,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:56,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:56,357 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733727111] [2024-11-02 19:54:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1733727111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:56,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2024-11-02 19:54:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295282379] [2024-11-02 19:54:56,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:56,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 19:54:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:56,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 19:54:56,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-02 19:54:56,362 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:56,449 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-02 19:54:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-02 19:54:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:56,450 INFO L225 Difference]: With dead ends: 29 [2024-11-02 19:54:56,450 INFO L226 Difference]: Without dead ends: 25 [2024-11-02 19:54:56,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-02 19:54:56,452 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:56,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-02 19:54:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-02 19:54:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-02 19:54:56,458 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 12 [2024-11-02 19:54:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-02 19:54:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-02 19:54:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:56,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:56,459 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:56,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:54:56,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:56,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1786738894, now seen corresponding path program 2 times [2024-11-02 19:54:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177209559] [2024-11-02 19:54:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:57,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-02 19:54:57,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:58,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:58,380 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177209559] [2024-11-02 19:54:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177209559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:58,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-02 19:54:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199906397] [2024-11-02 19:54:58,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-02 19:54:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-02 19:54:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-02 19:54:58,384 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:58,752 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2024-11-02 19:54:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-02 19:54:58,752 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-02 19:54:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:58,753 INFO L225 Difference]: With dead ends: 53 [2024-11-02 19:54:58,753 INFO L226 Difference]: Without dead ends: 49 [2024-11-02 19:54:58,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-02 19:54:58,755 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 87 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:58,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-02 19:54:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-02 19:54:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-02 19:54:58,771 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 24 [2024-11-02 19:54:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:58,771 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-02 19:54:58,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-02 19:54:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 19:54:58,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:58,773 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:58,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:54:58,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:58,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2024-11-02 19:54:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351580816] [2024-11-02 19:54:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:05,330 WARN L253 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-02 19:55:05,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:06,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:22,359 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351580816] [2024-11-02 19:55:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [351580816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:22,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-02 19:55:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745654836] [2024-11-02 19:55:22,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:22,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-02 19:55:22,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-02 19:55:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2158, Unknown=2, NotChecked=0, Total=2652 [2024-11-02 19:55:22,363 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 52 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:48,672 WARN L286 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 117 DAG size of output: 156 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-02 19:55:53,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:55:59,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:56:04,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:56:09,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:56:15,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:56:20,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-02 19:56:26,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]