/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_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:54:50,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:54:50,568 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:50,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:54:50,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:54:50,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:54:50,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:54:50,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:54:50,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:54:50,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:54:50,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:54:50,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:54:50,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:54:50,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:54:50,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:54:50,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:54:50,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:54:50,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:54:50,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:54:50,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:54:50,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:54:50,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:54:50,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:54:50,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:54:50,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:54:50,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:50,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:54:50,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:54:50,607 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:54:50,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:54:50,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:54:50,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:54:50,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:54:50,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:54:50,608 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:50,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:54:50,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:54:50,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:54:50,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:54:50,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:54:50,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_1.c [2024-11-02 19:54:52,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:54:52,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:54:52,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_1.c [2024-11-02 19:54:52,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5fe2bfa/8dcff8925a1a4f5397df5d9f7ed93061/FLAGe8ae60540 [2024-11-02 19:54:52,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5fe2bfa/8dcff8925a1a4f5397df5d9f7ed93061 [2024-11-02 19:54:52,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:54:52,980 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:54:52,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:52,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:54:52,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:54:52,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:52" (1/1) ... [2024-11-02 19:54:52,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af6cf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:52, skipping insertion in model container [2024-11-02 19:54:52,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:52" (1/1) ... [2024-11-02 19:54:53,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:54:53,222 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_1.c[673,686] [2024-11-02 19:54:53,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:53,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:54:53,250 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_1.c[673,686] [2024-11-02 19:54:53,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:53,268 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:54:53,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:53 WrapperNode [2024-11-02 19:54:53,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:53,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:53,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:54:53,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:54:53,274 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:53" (1/1) ... [2024-11-02 19:54:53,280 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:53" (1/1) ... [2024-11-02 19:54:53,292 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-11-02 19:54:53,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:53,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:54:53,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:54:53,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:54:53,302 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:53" (1/1) ... [2024-11-02 19:54:53,302 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:53" (1/1) ... [2024-11-02 19:54:53,304 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:53" (1/1) ... [2024-11-02 19:54:53,311 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:53,311 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:53" (1/1) ... [2024-11-02 19:54:53,312 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:53" (1/1) ... [2024-11-02 19:54:53,315 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:53" (1/1) ... [2024-11-02 19:54:53,318 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:53" (1/1) ... [2024-11-02 19:54:53,319 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:53" (1/1) ... [2024-11-02 19:54:53,320 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:53" (1/1) ... [2024-11-02 19:54:53,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:54:53,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:54:53,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:54:53,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:54:53,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:53" (1/1) ... [2024-11-02 19:54:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:53,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:54:53,351 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:53,353 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:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:54:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:54:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:54:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:54:53,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:54:53,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:54:53,506 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-02 19:54:53,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:54:53,514 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:54:53,514 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 19:54:53,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:53 BoogieIcfgContainer [2024-11-02 19:54:53,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:54:53,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:54:53,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:54:53,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:54:53,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:54:52" (1/3) ... [2024-11-02 19:54:53,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780de1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:53, skipping insertion in model container [2024-11-02 19:54:53,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:53" (2/3) ... [2024-11-02 19:54:53,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780de1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:53, skipping insertion in model container [2024-11-02 19:54:53,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:53" (3/3) ... [2024-11-02 19:54:53,520 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-11-02 19:54:53,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:54:53,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:54:53,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:54:53,578 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;@3ce592f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:54:53,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:54:53,580 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:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 19:54:53,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:53,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 19:54:53,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:53,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-02 19:54:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104908432] [2024-11-02 19:54:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:53,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-02 19:54:53,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:53,707 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:53,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:53,710 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:53,711 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104908432] [2024-11-02 19:54:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2104908432] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:53,713 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-02 19:54:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608052430] [2024-11-02 19:54:53,716 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 19:54:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 19:54:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:53,740 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:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:53,749 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-02 19:54:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 19:54:53,752 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:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:53,756 INFO L225 Difference]: With dead ends: 21 [2024-11-02 19:54:53,757 INFO L226 Difference]: Without dead ends: 9 [2024-11-02 19:54:53,758 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:53,762 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:53,764 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:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-02 19:54:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-02 19:54:53,814 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:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-02 19:54:53,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-02 19:54:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:53,815 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-02 19:54:53,815 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:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-02 19:54:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 19:54:53,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:53,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 19:54:53,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:54:53,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-02 19:54:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433645486] [2024-11-02 19:54:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:53,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:54:53,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:53,910 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:53,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:53,918 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:53,918 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433645486] [2024-11-02 19:54:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1433645486] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:53,918 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:53,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36811629] [2024-11-02 19:54:53,919 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:53,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:53,920 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:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:53,934 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-02 19:54:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:53,934 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:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:53,935 INFO L225 Difference]: With dead ends: 17 [2024-11-02 19:54:53,935 INFO L226 Difference]: Without dead ends: 13 [2024-11-02 19:54:53,935 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:53,936 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:53,936 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:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-02 19:54:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-02 19:54:53,939 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:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-02 19:54:53,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2024-11-02 19:54:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-02 19:54:53,940 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:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-02 19:54:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:53,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:53,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:53,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:54:53,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 1 times [2024-11-02 19:54:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688118137] [2024-11-02 19:54:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:54,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 19:54:54,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:54:54,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:54:54,520 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688118137] [2024-11-02 19:54:54,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1688118137] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:54,521 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:54,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-02 19:54:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346933083] [2024-11-02 19:54:54,521 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:54,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 19:54:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 19:54:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:54:54,525 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:54,566 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-02 19:54:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:54,568 INFO L225 Difference]: With dead ends: 22 [2024-11-02 19:54:54,568 INFO L226 Difference]: Without dead ends: 13 [2024-11-02 19:54:54,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:54:54,569 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:54,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-02 19:54:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-02 19:54:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-02 19:54:54,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2024-11-02 19:54:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-02 19:54:54,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-02 19:54:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:54,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:54,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:54:54,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:54,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1664855024, now seen corresponding path program 1 times [2024-11-02 19:54:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [56170040] [2024-11-02 19:54:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:55,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:55,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:55,098 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:55,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:55,150 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:55,150 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [56170040] [2024-11-02 19:54:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [56170040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:55,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 19:54:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621249880] [2024-11-02 19:54:55,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:55,152 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:55,215 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-02 19:54:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:55,216 INFO L225 Difference]: With dead ends: 29 [2024-11-02 19:54:55,216 INFO L226 Difference]: Without dead ends: 25 [2024-11-02 19:54:55,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:55,217 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:55,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-02 19:54:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-02 19:54:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-02 19:54:55,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 12 [2024-11-02 19:54:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:55,225 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-02 19:54:55,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-02 19:54:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:55,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:55,226 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:55,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:54:55,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:55,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2085526576, now seen corresponding path program 2 times [2024-11-02 19:54:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133711255] [2024-11-02 19:54:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:57,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-02 19:54:57,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-02 19:54:57,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-02 19:54:57,343 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1133711255] [2024-11-02 19:54:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1133711255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:57,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:57,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-02 19:54:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472807171] [2024-11-02 19:54:57,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:57,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-02 19:54:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-02 19:54:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-02 19:54:57,345 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:57,465 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-02 19:54:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-02 19:54:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-02 19:54:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:57,466 INFO L225 Difference]: With dead ends: 42 [2024-11-02 19:54:57,467 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 19:54:57,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-02 19:54:57,468 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:57,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 19:54:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-02 19:54:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-02 19:54:57,472 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2024-11-02 19:54:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:57,472 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-02 19:54:57,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:54:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-02 19:54:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:57,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:57,473 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:54:57,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:57,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -986835344, now seen corresponding path program 3 times [2024-11-02 19:54:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704465056] [2024-11-02 19:54:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:58,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-02 19:54:58,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:58,792 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,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:59,000 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:59,000 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704465056] [2024-11-02 19:54:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [704465056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:59,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-02 19:54:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112404457] [2024-11-02 19:54:59,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-02 19:54:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-02 19:54:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-02 19:54:59,002 INFO L87 Difference]: Start difference. First operand 26 states and 30 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:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:59,276 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-11-02 19:54:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-02 19:54:59,277 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:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:59,277 INFO L225 Difference]: With dead ends: 53 [2024-11-02 19:54:59,277 INFO L226 Difference]: Without dead ends: 49 [2024-11-02 19:54:59,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-02 19:54:59,278 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:59,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 124 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-02 19:54:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-02 19:54:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 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:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-02 19:54:59,291 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 24 [2024-11-02 19:54:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:59,292 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-02 19:54:59,292 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:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-02 19:54:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 19:54:59,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:59,292 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:54:59,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:59,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 4 times [2024-11-02 19:54:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288391847] [2024-11-02 19:54:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:02,346 WARN L253 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-02 19:55:02,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:02,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:03,955 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288391847] [2024-11-02 19:55:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [288391847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:03,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2024-11-02 19:55:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102211976] [2024-11-02 19:55:03,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-02 19:55:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-02 19:55:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2024-11-02 19:55:03,958 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 35 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 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:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:06,329 INFO L93 Difference]: Finished difference Result 221 states and 282 transitions. [2024-11-02 19:55:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-02 19:55:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 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 30 [2024-11-02 19:55:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:06,335 INFO L225 Difference]: With dead ends: 221 [2024-11-02 19:55:06,335 INFO L226 Difference]: Without dead ends: 216 [2024-11-02 19:55:06,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=508, Invalid=2248, Unknown=0, NotChecked=0, Total=2756 [2024-11-02 19:55:06,340 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:06,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 142 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:55:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-02 19:55:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 167. [2024-11-02 19:55:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 0 states have call successors, (0), 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:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 220 transitions. [2024-11-02 19:55:06,374 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 220 transitions. Word has length 30 [2024-11-02 19:55:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:06,374 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 220 transitions. [2024-11-02 19:55:06,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 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:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2024-11-02 19:55:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 19:55:06,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:06,376 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:06,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:55:06,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:06,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 5 times [2024-11-02 19:55:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339924474] [2024-11-02 19:55:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:08,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-02 19:55:08,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-02 19:55:08,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-02 19:55:08,428 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339924474] [2024-11-02 19:55:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [339924474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:08,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-02 19:55:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672126172] [2024-11-02 19:55:08,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 19:55:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:08,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 19:55:08,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-02 19:55:08,429 INFO L87 Difference]: Start difference. First operand 167 states and 220 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:08,543 INFO L93 Difference]: Finished difference Result 216 states and 283 transitions. [2024-11-02 19:55:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:55:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 30 [2024-11-02 19:55:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:08,544 INFO L225 Difference]: With dead ends: 216 [2024-11-02 19:55:08,544 INFO L226 Difference]: Without dead ends: 0 [2024-11-02 19:55:08,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-02 19:55:08,545 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:08,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-02 19:55:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-02 19:55:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-02 19:55:08,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-02 19:55:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:08,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-02 19:55:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-02 19:55:08,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-02 19:55:08,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 19:55:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:55:08,554 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2024-11-02 19:55:08,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-02 19:55:08,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 19:55:08,896 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-02 19:55:08,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:55:08 BoogieIcfgContainer [2024-11-02 19:55:08,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 19:55:08,899 INFO L158 Benchmark]: Toolchain (without parser) took 15918.91ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 282.3MB in the beginning and 735.4MB in the end (delta: -453.2MB). Peak memory consumption was 275.9MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,899 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 197.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-02 19:55:08,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.65ms. Allocated memory is still 343.9MB. Free memory was 282.3MB in the beginning and 269.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.04ms. Allocated memory is still 343.9MB. Free memory was 269.4MB in the beginning and 267.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,899 INFO L158 Benchmark]: Boogie Preprocessor took 27.66ms. Allocated memory is still 343.9MB. Free memory was 267.9MB in the beginning and 266.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,899 INFO L158 Benchmark]: RCFGBuilder took 189.18ms. Allocated memory is still 343.9MB. Free memory was 266.2MB in the beginning and 256.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,900 INFO L158 Benchmark]: TraceAbstraction took 15382.11ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 255.4MB in the beginning and 735.4MB in the end (delta: -480.0MB). Peak memory consumption was 249.7MB. Max. memory is 8.0GB. [2024-11-02 19:55:08,900 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.20ms. Allocated memory is still 197.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.65ms. Allocated memory is still 343.9MB. Free memory was 282.3MB in the beginning and 269.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.04ms. Allocated memory is still 343.9MB. Free memory was 269.4MB in the beginning and 267.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.66ms. Allocated memory is still 343.9MB. Free memory was 267.9MB in the beginning and 266.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 189.18ms. Allocated memory is still 343.9MB. Free memory was 266.2MB in the beginning and 256.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15382.11ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 255.4MB in the beginning and 735.4MB in the end (delta: -480.0MB). Peak memory consumption was 249.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 74 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=7, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 24 QuantifiedInterpolants, 3310 SizeOfPredicates, 33 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 236/592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((y == 1) && (x == 37)) && (c == 1)) || (((x == 37) && (c == 6)) && (y == 37))) || (((c == 3) && (x == 37)) && (y == 5))) || (((x == 37) && (c == 4)) && (y == 5))) || (((c == 5) && (x == 37)) && (y == 5))) || ((x == 37) && (y == 37))) || (((y == 0) && (c == 0)) && (x == 37))) || (((y == 1) && (c == 2)) && (x == 37))) RESULT: Ultimate proved your program to be correct! [2024-11-02 19:55:08,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...