/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:24:03,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:24:03,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:24:03,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:24:03,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:24:03,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:24:03,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:24:03,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:24:03,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:24:03,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:24:03,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:24:03,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:24:03,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:24:03,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:24:03,667 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:24:03,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:24:03,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:24:03,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:24:03,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:24:03,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:24:03,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:24:03,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:24:03,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:24:03,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:24:03,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:24:03,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:24:03,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:24:03,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:24:03,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:24:03,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:24:03,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:24:03,892 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:24:03,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2025-04-13 22:24:05,210 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7769d5/c28944f283764f098585ee9f9dfe48c7/FLAGc368373a2 [2025-04-13 22:24:05,421 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:24:05,421 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2025-04-13 22:24:05,443 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7769d5/c28944f283764f098585ee9f9dfe48c7/FLAGc368373a2 [2025-04-13 22:24:06,362 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7769d5/c28944f283764f098585ee9f9dfe48c7 [2025-04-13 22:24:06,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:24:06,365 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:24:06,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:24:06,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:24:06,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:24:06,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a99e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06, skipping insertion in model container [2025-04-13 22:24:06,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:24:06,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] [2025-04-13 22:24:06,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:24:06,547 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:24:06,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] [2025-04-13 22:24:06,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:24:06,581 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:24:06,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06 WrapperNode [2025-04-13 22:24:06,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:24:06,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:24:06,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:24:06,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:24:06,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,611 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 157 [2025-04-13 22:24:06,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:24:06,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:24:06,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:24:06,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:24:06,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,629 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]. [2025-04-13 22:24:06,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:24:06,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:24:06,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:24:06,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:24:06,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (1/1) ... [2025-04-13 22:24:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:24:06,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:06,666 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) [2025-04-13 22:24:06,667 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 [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:24:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:24:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:24:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:24:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:24:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:24:06,686 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:24:06,754 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:24:06,756 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:24:06,958 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:24:06,959 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:24:06,959 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:24:07,211 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:24:07,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:24:07 BoogieIcfgContainer [2025-04-13 22:24:07,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:24:07,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:24:07,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:24:07,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:24:07,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:24:06" (1/3) ... [2025-04-13 22:24:07,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef2ee3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:24:07, skipping insertion in model container [2025-04-13 22:24:07,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:24:06" (2/3) ... [2025-04-13 22:24:07,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef2ee3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:24:07, skipping insertion in model container [2025-04-13 22:24:07,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:24:07" (3/3) ... [2025-04-13 22:24:07,219 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-04-13 22:24:07,229 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:24:07,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 19 locations, 15 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 22:24:07,230 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:24:07,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:24:07,297 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 22:24:07,308 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 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) [2025-04-13 22:24:07,326 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:24:07,335 INFO L340 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=FINITE_AUTOMATA, 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;@3c36437d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:24:07,335 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:24:07,337 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 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) [2025-04-13 22:24:07,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:07,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:07,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:07,340 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:07,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2095491662, now seen corresponding path program 1 times [2025-04-13 22:24:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:07,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352337083] [2025-04-13 22:24:07,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:24:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:07,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:24:07,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:07,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:07,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:08,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352337083] [2025-04-13 22:24:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352337083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:08,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68873211] [2025-04-13 22:24:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:08,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:08,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:08,959 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 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 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:09,161 INFO L93 Difference]: Finished difference Result 56 states and 88 transitions. [2025-04-13 22:24:09,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:09,162 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:09,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:09,166 INFO L225 Difference]: With dead ends: 56 [2025-04-13 22:24:09,166 INFO L226 Difference]: Without dead ends: 44 [2025-04-13 22:24:09,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:09,169 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:09,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:24:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-13 22:24:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-04-13 22:24:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2025-04-13 22:24:09,192 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 14 [2025-04-13 22:24:09,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:09,192 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2025-04-13 22:24:09,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:09,192 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2025-04-13 22:24:09,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:09,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:09,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:09,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:24:09,193 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:09,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1437652122, now seen corresponding path program 2 times [2025-04-13 22:24:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:09,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592383518] [2025-04-13 22:24:09,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:09,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:24:09,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:09,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:24:09,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:09,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592383518] [2025-04-13 22:24:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592383518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340361600] [2025-04-13 22:24:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:09,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:09,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:09,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:09,826 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:09,998 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2025-04-13 22:24:09,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:09,999 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:09,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:09,999 INFO L225 Difference]: With dead ends: 53 [2025-04-13 22:24:09,999 INFO L226 Difference]: Without dead ends: 37 [2025-04-13 22:24:09,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:10,000 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:10,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:24:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-13 22:24:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-04-13 22:24:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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) [2025-04-13 22:24:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2025-04-13 22:24:10,003 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 14 [2025-04-13 22:24:10,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:10,003 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2025-04-13 22:24:10,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:10,003 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2025-04-13 22:24:10,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:10,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:10,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:10,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:24:10,004 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:10,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash 667124282, now seen corresponding path program 3 times [2025-04-13 22:24:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:10,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496457854] [2025-04-13 22:24:10,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:10,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:24:10,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:10,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:24:10,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:10,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496457854] [2025-04-13 22:24:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496457854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958506637] [2025-04-13 22:24:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:10,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:10,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:10,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:10,789 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:11,012 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-04-13 22:24:11,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:11,013 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:11,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:11,013 INFO L225 Difference]: With dead ends: 43 [2025-04-13 22:24:11,013 INFO L226 Difference]: Without dead ends: 31 [2025-04-13 22:24:11,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:11,014 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:11,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:24:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-13 22:24:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-04-13 22:24:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2025-04-13 22:24:11,016 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 14 [2025-04-13 22:24:11,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:11,016 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2025-04-13 22:24:11,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:11,018 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2025-04-13 22:24:11,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:11,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:11,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:11,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:24:11,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:11,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2057381212, now seen corresponding path program 4 times [2025-04-13 22:24:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:11,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34329362] [2025-04-13 22:24:11,021 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:11,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:11,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 22:24:11,042 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:11,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:11,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:11,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34329362] [2025-04-13 22:24:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34329362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162238187] [2025-04-13 22:24:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:11,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:11,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:11,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:11,633 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:11,829 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-04-13 22:24:11,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:11,829 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:11,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:11,829 INFO L225 Difference]: With dead ends: 33 [2025-04-13 22:24:11,830 INFO L226 Difference]: Without dead ends: 21 [2025-04-13 22:24:11,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:11,830 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:11,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:24:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-13 22:24:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-13 22:24:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 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) [2025-04-13 22:24:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-04-13 22:24:11,836 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2025-04-13 22:24:11,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:11,836 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-04-13 22:24:11,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:11,836 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-04-13 22:24:11,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:11,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:11,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:11,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:24:11,836 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:11,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -161980610, now seen corresponding path program 5 times [2025-04-13 22:24:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:11,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772512907] [2025-04-13 22:24:11,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:11,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:24:11,865 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:11,866 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:24:11,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:12,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772512907] [2025-04-13 22:24:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772512907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:12,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497541476] [2025-04-13 22:24:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:12,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:12,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:12,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:12,271 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:12,414 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-13 22:24:12,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:12,415 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:12,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:12,415 INFO L225 Difference]: With dead ends: 27 [2025-04-13 22:24:12,415 INFO L226 Difference]: Without dead ends: 18 [2025-04-13 22:24:12,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:12,416 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:12,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:24:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-13 22:24:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-04-13 22:24:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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) [2025-04-13 22:24:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-04-13 22:24:12,417 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2025-04-13 22:24:12,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:12,417 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-04-13 22:24:12,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:12,418 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-04-13 22:24:12,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:24:12,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:12,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:12,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:24:12,418 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:12,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash -143212280, now seen corresponding path program 6 times [2025-04-13 22:24:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:12,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453658924] [2025-04-13 22:24:12,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:12,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:12,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:24:12,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:24:12,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:24:12,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:12,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453658924] [2025-04-13 22:24:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453658924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:24:12,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:24:12,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:24:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878915675] [2025-04-13 22:24:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:24:12,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:24:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:12,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:24:12,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:24:12,970 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:13,161 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-04-13 22:24:13,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:24:13,162 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 14 [2025-04-13 22:24:13,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:13,162 INFO L225 Difference]: With dead ends: 18 [2025-04-13 22:24:13,162 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:24:13,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:24:13,163 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:13,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:24:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:24:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:24:13,164 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) [2025-04-13 22:24:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:24:13,164 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-04-13 22:24:13,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:13,164 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:24:13,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2025-04-13 22:24:13,164 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:24:13,164 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:24:13,166 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:24:13,167 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:24:13,167 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:24:13,167 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:24:13,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:24:13,169 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-13 22:24:13,170 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:24:13,170 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:24:13,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:24:13 BasicIcfg [2025-04-13 22:24:13,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:24:13,172 INFO L158 Benchmark]: Toolchain (without parser) took 6807.24ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 101.1MB in the beginning and 141.4MB in the end (delta: -40.4MB). Peak memory consumption was 176.2MB. Max. memory is 8.0GB. [2025-04-13 22:24:13,173 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:24:13,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.01ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 86.1MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:24:13,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.47ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:24:13,173 INFO L158 Benchmark]: Boogie Preprocessor took 24.14ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:24:13,173 INFO L158 Benchmark]: IcfgBuilder took 575.34ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 82.0MB in the end (delta: 485.2kB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. [2025-04-13 22:24:13,174 INFO L158 Benchmark]: TraceAbstraction took 5958.98ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 81.3MB in the beginning and 141.4MB in the end (delta: -60.1MB). Peak memory consumption was 157.2MB. Max. memory is 8.0GB. [2025-04-13 22:24:13,174 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.19ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.01ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 86.1MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.47ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.14ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 575.34ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 82.0MB in the end (delta: 485.2kB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5958.98ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 81.3MB in the beginning and 141.4MB in the end (delta: -60.1MB). Peak memory consumption was 157.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 81]: 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 with 1 thread instances CFG has 7 procedures, 28 locations, 27 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 2402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:24:13,194 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...