/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:12:14,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:12:14,099 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 17:12:14,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:12:14,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:12:14,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:12:14,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:12:14,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:12:14,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:12:14,127 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:12:14,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:12:14,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:12:14,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:12:14,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:12:14,127 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:12:14,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:12:14,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:12:14,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:14,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:14,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:12:14,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:12:14,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:12:14,131 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 [2025-04-13 17:12:14,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:12:14,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:12:14,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:12:14,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:12:14,351 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:12:14,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-04-13 17:12:15,581 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e55a72e/40f791ca391a4d0dbc8d67c78150fd2b/FLAG80f1c05d7 [2025-04-13 17:12:15,807 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:12:15,807 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-04-13 17:12:15,815 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e55a72e/40f791ca391a4d0dbc8d67c78150fd2b/FLAG80f1c05d7 [2025-04-13 17:12:16,632 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e55a72e/40f791ca391a4d0dbc8d67c78150fd2b [2025-04-13 17:12:16,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:12:16,635 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:12:16,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:12:16,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:12:16,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:12:16,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca6c2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16, skipping insertion in model container [2025-04-13 17:12:16,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:12:16,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2025-04-13 17:12:16,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:12:16,878 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:12:16,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2025-04-13 17:12:16,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:12:16,950 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:12:16,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16 WrapperNode [2025-04-13 17:12:16,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:12:16,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:12:16,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:12:16,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:12:16,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,974 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-04-13 17:12:16,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:12:16,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:12:16,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:12:16,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:12:16,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,988 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 17:12:16,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:16,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:12:16,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:12:16,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:12:16,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:12:16,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (1/1) ... [2025-04-13 17:12:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:12:17,020 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 17:12:17,025 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 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 17:12:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:12:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:12:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:12:17,038 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:12:17,128 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:12:17,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:12:17,193 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:12:17,194 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:12:17,194 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:12:17,252 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 17:12:17,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:12:17 BoogieIcfgContainer [2025-04-13 17:12:17,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:12:17,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:12:17,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:12:17,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:12:17,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:12:16" (1/3) ... [2025-04-13 17:12:17,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da21b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:12:17, skipping insertion in model container [2025-04-13 17:12:17,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:16" (2/3) ... [2025-04-13 17:12:17,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da21b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:12:17, skipping insertion in model container [2025-04-13 17:12:17,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:12:17" (3/3) ... [2025-04-13 17:12:17,263 INFO L128 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2025-04-13 17:12:17,271 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:12:17,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 46_monabsex2_vs.i that has 2 procedures, 11 locations, 10 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 17:12:17,272 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:12:17,305 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:17,328 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 14 places, 11 transitions, 26 flow [2025-04-13 17:12:17,335 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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 17:12:17,352 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:17,362 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:17,362 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:12:17,364 INFO L278 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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 17:12:17,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:17,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:17,368 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2025-04-13 17:12:17,368 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 17:12:17,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 95382400, now seen corresponding path program 1 times [2025-04-13 17:12:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:17,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107840150] [2025-04-13 17:12:17,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:17,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:17,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:17,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:17,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:17,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:17,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:17,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:17,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:17,458 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 17:12:17,460 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 17:12:17,460 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 17:12:17,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:12:17,465 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 17:12:17,466 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:17,466 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:12:17,475 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:17,476 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 46 flow [2025-04-13 17:12:17,497 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 200 states, 192 states have (on average 2.4427083333333335) internal successors, (469), 199 states have internal predecessors, (469), 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 17:12:17,498 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:17,499 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:17,499 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:12:17,501 INFO L278 IsEmpty]: Start isEmpty. Operand has 200 states, 192 states have (on average 2.4427083333333335) internal successors, (469), 199 states have internal predecessors, (469), 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 17:12:17,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:17,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:17,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:12:17,501 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:12:17,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash 112566060, now seen corresponding path program 1 times [2025-04-13 17:12:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:17,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869973472] [2025-04-13 17:12:17,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:17,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:17,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:17,666 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 17:12:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:17,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869973472] [2025-04-13 17:12:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869973472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598100082] [2025-04-13 17:12:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:17,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:17,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:17,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:17,683 INFO L87 Difference]: Start difference. First operand has 200 states, 192 states have (on average 2.4427083333333335) internal successors, (469), 199 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:17,745 INFO L93 Difference]: Finished difference Result 212 states and 487 transitions. [2025-04-13 17:12:17,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:17,748 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 17:12:17,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:17,753 INFO L225 Difference]: With dead ends: 212 [2025-04-13 17:12:17,753 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 17:12:17,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:17,759 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:17,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 17:12:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-13 17:12:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 132 states have (on average 2.2954545454545454) internal successors, (303), 134 states have internal predecessors, (303), 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 17:12:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 303 transitions. [2025-04-13 17:12:17,803 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 303 transitions. Word has length 5 [2025-04-13 17:12:17,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:17,803 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 303 transitions. [2025-04-13 17:12:17,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:17,803 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 303 transitions. [2025-04-13 17:12:17,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:12:17,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:17,804 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 17:12:17,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:12:17,804 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:12:17,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 801423475, now seen corresponding path program 1 times [2025-04-13 17:12:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:17,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309137611] [2025-04-13 17:12:17,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:17,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:12:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:12:17,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:17,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:17,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:12:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:12:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:17,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:17,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:17,832 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 17:12:17,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 17:12:17,833 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 17:12:17,833 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 17:12:17,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:12:17,833 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:17,833 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:17,833 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 17:12:17,843 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:17,845 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 25 transitions, 68 flow [2025-04-13 17:12:17,914 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1459 states, 1440 states have (on average 3.254166666666667) internal successors, (4686), 1458 states have internal predecessors, (4686), 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 17:12:17,917 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:17,919 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:17,919 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:12:17,924 INFO L278 IsEmpty]: Start isEmpty. Operand has 1459 states, 1440 states have (on average 3.254166666666667) internal successors, (4686), 1458 states have internal predecessors, (4686), 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 17:12:17,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:17,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:17,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:12:17,925 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:12:17,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash 136429451, now seen corresponding path program 1 times [2025-04-13 17:12:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:17,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785991198] [2025-04-13 17:12:17,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:17,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:17,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:17,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:18,018 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 17:12:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:18,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785991198] [2025-04-13 17:12:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785991198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811769453] [2025-04-13 17:12:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:18,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:18,023 INFO L87 Difference]: Start difference. First operand has 1459 states, 1440 states have (on average 3.254166666666667) internal successors, (4686), 1458 states have internal predecessors, (4686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:18,127 INFO L93 Difference]: Finished difference Result 1665 states and 5197 transitions. [2025-04-13 17:12:18,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:18,128 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 17:12:18,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:18,143 INFO L225 Difference]: With dead ends: 1665 [2025-04-13 17:12:18,143 INFO L226 Difference]: Without dead ends: 941 [2025-04-13 17:12:18,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:18,146 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:18,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-04-13 17:12:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2025-04-13 17:12:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 934 states have (on average 3.102783725910064) internal successors, (2898), 940 states have internal predecessors, (2898), 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 17:12:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2898 transitions. [2025-04-13 17:12:18,228 INFO L79 Accepts]: Start accepts. Automaton has 941 states and 2898 transitions. Word has length 5 [2025-04-13 17:12:18,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:18,228 INFO L485 AbstractCegarLoop]: Abstraction has 941 states and 2898 transitions. [2025-04-13 17:12:18,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:18,229 INFO L278 IsEmpty]: Start isEmpty. Operand 941 states and 2898 transitions. [2025-04-13 17:12:18,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:12:18,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:18,229 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 17:12:18,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:12:18,230 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:12:18,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2054307718, now seen corresponding path program 1 times [2025-04-13 17:12:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:18,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998619613] [2025-04-13 17:12:18,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:18,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:12:18,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:12:18,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:18,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:18,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:18,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:12:18,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:12:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:18,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:18,243 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:18,243 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 17:12:18,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:12:18,244 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 17:12:18,244 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 17:12:18,244 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:12:18,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:12:18,244 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:18,244 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:18,244 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 17:12:18,260 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:18,261 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 32 transitions, 92 flow [2025-04-13 17:12:18,547 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10464 states, 10422 states have (on average 4.092784494338899) internal successors, (42655), 10463 states have internal predecessors, (42655), 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 17:12:18,549 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:18,549 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:18,549 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:12:18,582 INFO L278 IsEmpty]: Start isEmpty. Operand has 10464 states, 10422 states have (on average 4.092784494338899) internal successors, (42655), 10463 states have internal predecessors, (42655), 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 17:12:18,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:18,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:18,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:12:18,584 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:12:18,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 166973169, now seen corresponding path program 1 times [2025-04-13 17:12:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:18,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43991458] [2025-04-13 17:12:18,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:18,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:18,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:18,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:18,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:18,635 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 17:12:18,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:18,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43991458] [2025-04-13 17:12:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43991458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:18,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:18,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423855615] [2025-04-13 17:12:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:18,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:18,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:18,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:18,662 INFO L87 Difference]: Start difference. First operand has 10464 states, 10422 states have (on average 4.092784494338899) internal successors, (42655), 10463 states have internal predecessors, (42655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:18,948 INFO L93 Difference]: Finished difference Result 12812 states and 50759 transitions. [2025-04-13 17:12:18,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:18,949 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 17:12:18,949 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:19,011 INFO L225 Difference]: With dead ends: 12812 [2025-04-13 17:12:19,011 INFO L226 Difference]: Without dead ends: 6755 [2025-04-13 17:12:19,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:19,027 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:19,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2025-04-13 17:12:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6755. [2025-04-13 17:12:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6755 states, 6740 states have (on average 3.9363501483679526) internal successors, (26531), 6754 states have internal predecessors, (26531), 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 17:12:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 26531 transitions. [2025-04-13 17:12:19,453 INFO L79 Accepts]: Start accepts. Automaton has 6755 states and 26531 transitions. Word has length 5 [2025-04-13 17:12:19,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:19,454 INFO L485 AbstractCegarLoop]: Abstraction has 6755 states and 26531 transitions. [2025-04-13 17:12:19,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:19,454 INFO L278 IsEmpty]: Start isEmpty. Operand 6755 states and 26531 transitions. [2025-04-13 17:12:19,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:12:19,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:19,455 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:19,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:12:19,455 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:12:19,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -268707755, now seen corresponding path program 1 times [2025-04-13 17:12:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:19,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939930801] [2025-04-13 17:12:19,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:19,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:19,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:19,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:19,506 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 17:12:19,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:19,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939930801] [2025-04-13 17:12:19,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939930801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:19,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:12:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39949654] [2025-04-13 17:12:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:19,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:19,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:19,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:19,507 INFO L87 Difference]: Start difference. First operand 6755 states and 26531 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 17:12:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:19,689 INFO L93 Difference]: Finished difference Result 6755 states and 26531 transitions. [2025-04-13 17:12:19,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:19,690 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-04-13 17:12:19,690 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:19,737 INFO L225 Difference]: With dead ends: 6755 [2025-04-13 17:12:19,738 INFO L226 Difference]: Without dead ends: 4407 [2025-04-13 17:12:19,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:19,746 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:19,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2025-04-13 17:12:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 4407. [2025-04-13 17:12:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4407 states, 4406 states have (on average 3.922151611438947) internal successors, (17281), 4406 states have internal predecessors, (17281), 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 17:12:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 17281 transitions. [2025-04-13 17:12:19,939 INFO L79 Accepts]: Start accepts. Automaton has 4407 states and 17281 transitions. Word has length 11 [2025-04-13 17:12:19,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:19,939 INFO L485 AbstractCegarLoop]: Abstraction has 4407 states and 17281 transitions. [2025-04-13 17:12:19,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 17:12:19,940 INFO L278 IsEmpty]: Start isEmpty. Operand 4407 states and 17281 transitions. [2025-04-13 17:12:19,940 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:12:19,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:19,941 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:19,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:12:19,941 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:12:19,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1876904907, now seen corresponding path program 1 times [2025-04-13 17:12:19,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:19,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984289429] [2025-04-13 17:12:19,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:19,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:19,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:19,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:19,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:19,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:19,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:19,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:19,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:19,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:19,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:19,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:12:19,967 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:12:19,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:12:19,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 17:12:19,968 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:19,968 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 17:12:19,986 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:19,989 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions, 118 flow [2025-04-13 17:12:21,766 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 74267 states, 74178 states have (on average 4.945131979832295) internal successors, (366820), 74266 states have internal predecessors, (366820), 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 17:12:21,773 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:21,773 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:21,773 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 17:12:21,918 INFO L278 IsEmpty]: Start isEmpty. Operand has 74267 states, 74178 states have (on average 4.945131979832295) internal successors, (366820), 74266 states have internal predecessors, (366820), 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 17:12:21,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:21,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:21,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:12:21,920 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:21,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash 204196638, now seen corresponding path program 1 times [2025-04-13 17:12:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:21,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827648345] [2025-04-13 17:12:21,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:21,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:21,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:21,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:21,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:21,982 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 17:12:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:21,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827648345] [2025-04-13 17:12:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827648345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991937398] [2025-04-13 17:12:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:21,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:21,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:21,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:22,121 INFO L87 Difference]: Start difference. First operand has 74267 states, 74178 states have (on average 4.945131979832295) internal successors, (366820), 74266 states have internal predecessors, (366820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:23,646 INFO L93 Difference]: Finished difference Result 96669 states and 465661 transitions. [2025-04-13 17:12:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:23,647 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 17:12:23,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:24,298 INFO L225 Difference]: With dead ends: 96669 [2025-04-13 17:12:24,302 INFO L226 Difference]: Without dead ends: 48841 [2025-04-13 17:12:24,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:24,408 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:24,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48841 states. [2025-04-13 17:12:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48841 to 48841. [2025-04-13 17:12:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48841 states, 48810 states have (on average 4.789223519770538) internal successors, (233762), 48840 states have internal predecessors, (233762), 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 17:12:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48841 states to 48841 states and 233762 transitions. [2025-04-13 17:12:26,438 INFO L79 Accepts]: Start accepts. Automaton has 48841 states and 233762 transitions. Word has length 5 [2025-04-13 17:12:26,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:26,438 INFO L485 AbstractCegarLoop]: Abstraction has 48841 states and 233762 transitions. [2025-04-13 17:12:26,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:12:26,438 INFO L278 IsEmpty]: Start isEmpty. Operand 48841 states and 233762 transitions. [2025-04-13 17:12:26,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:12:26,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:26,441 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:26,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:12:26,441 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:26,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 983478726, now seen corresponding path program 1 times [2025-04-13 17:12:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:26,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475649122] [2025-04-13 17:12:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:26,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:26,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:26,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:26,491 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 17:12:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:26,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475649122] [2025-04-13 17:12:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475649122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:12:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545052270] [2025-04-13 17:12:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:26,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:26,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:26,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:26,492 INFO L87 Difference]: Start difference. First operand 48841 states and 233762 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) [2025-04-13 17:12:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:27,710 INFO L93 Difference]: Finished difference Result 48841 states and 233762 transitions. [2025-04-13 17:12:27,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:27,711 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) Word has length 11 [2025-04-13 17:12:27,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:27,931 INFO L225 Difference]: With dead ends: 48841 [2025-04-13 17:12:27,931 INFO L226 Difference]: Without dead ends: 26439 [2025-04-13 17:12:27,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:27,989 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:27,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26439 states. [2025-04-13 17:12:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26439 to 26439. [2025-04-13 17:12:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26439 states, 26438 states have (on average 4.755011725546562) internal successors, (125713), 26438 states have internal predecessors, (125713), 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 17:12:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26439 states to 26439 states and 125713 transitions. [2025-04-13 17:12:29,147 INFO L79 Accepts]: Start accepts. Automaton has 26439 states and 125713 transitions. Word has length 11 [2025-04-13 17:12:29,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:29,147 INFO L485 AbstractCegarLoop]: Abstraction has 26439 states and 125713 transitions. [2025-04-13 17:12:29,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) [2025-04-13 17:12:29,147 INFO L278 IsEmpty]: Start isEmpty. Operand 26439 states and 125713 transitions. [2025-04-13 17:12:29,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:12:29,149 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:29,149 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:29,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:12:29,149 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:29,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1695925316, now seen corresponding path program 1 times [2025-04-13 17:12:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:29,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746025746] [2025-04-13 17:12:29,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:29,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:29,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:29,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:29,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:29,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:29,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:29,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:29,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:29,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:29,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:29,161 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:29,161 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 17:12:29,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 17:12:29,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:12:29,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 17:12:29,162 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:29,166 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 17:12:29,182 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:29,185 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 46 transitions, 146 flow [2025-04-13 17:12:44,742 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 523960 states, 523776 states have (on average 5.802619822214076) internal successors, (3039273), 523959 states have internal predecessors, (3039273), 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 17:12:44,747 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:44,748 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;@d4894eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:44,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 17:12:45,726 INFO L278 IsEmpty]: Start isEmpty. Operand has 523960 states, 523776 states have (on average 5.802619822214076) internal successors, (3039273), 523959 states have internal predecessors, (3039273), 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 17:12:45,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:45,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:45,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:12:45,727 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 17:12:45,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 248100434, now seen corresponding path program 1 times [2025-04-13 17:12:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:45,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638912155] [2025-04-13 17:12:45,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:45,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:45,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:45,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:45,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:45,757 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 17:12:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:45,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638912155] [2025-04-13 17:12:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638912155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038428089] [2025-04-13 17:12:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:45,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:45,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:45,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:46,686 INFO L87 Difference]: Start difference. First operand has 523960 states, 523776 states have (on average 5.802619822214076) internal successors, (3039273), 523959 states have internal predecessors, (3039273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17:13:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:13:01,548 INFO L93 Difference]: Finished difference Result 717824 states and 4078839 transitions. [2025-04-13 17:13:01,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:13:01,550 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 17:13:01,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:13:06,557 INFO L225 Difference]: With dead ends: 717824 [2025-04-13 17:13:06,557 INFO L226 Difference]: Without dead ends: 352495 [2025-04-13 17:13:07,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:13:07,192 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:13:07,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:13:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352495 states.