/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 -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 21:32:41,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 21:32:41,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-15 21:32:41,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 21:32:41,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 21:32:41,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 21:32:41,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 21:32:41,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 21:32:41,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 21:32:41,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 21:32:41,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 21:32:41,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 21:32:41,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 21:32:41,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 21:32:41,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 21:32:41,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 21:32:41,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 21:32:41,154 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 21:32:41,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 21:32:41,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:32:41,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 21:32:41,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-15 21:32:41,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 21:32:41,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 21:32:41,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 21:32:41,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 21:32:41,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 21:32:41,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2024-11-15 21:32:42,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 21:32:43,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 21:32:43,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2024-11-15 21:32:43,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/606c5e3c6/97c32950c8e14c56ae8b57e57d50c1d5/FLAG19dfcc063 [2024-11-15 21:32:43,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/606c5e3c6/97c32950c8e14c56ae8b57e57d50c1d5 [2024-11-15 21:32:43,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 21:32:43,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 21:32:43,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 21:32:43,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 21:32:43,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 21:32:43,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13647096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43, skipping insertion in model container [2024-11-15 21:32:43,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 21:32:43,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30419,30432] [2024-11-15 21:32:43,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:32:43,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 21:32:43,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30419,30432] [2024-11-15 21:32:43,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:32:43,533 INFO L204 MainTranslator]: Completed translation [2024-11-15 21:32:43,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43 WrapperNode [2024-11-15 21:32:43,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 21:32:43,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 21:32:43,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 21:32:43,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 21:32:43,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,573 INFO L138 Inliner]: procedures = 164, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-11-15 21:32:43,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 21:32:43,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 21:32:43,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 21:32:43,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 21:32:43,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 21:32:43,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 21:32:43,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 21:32:43,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 21:32:43,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (1/1) ... [2024-11-15 21:32:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:32:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:32:43,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-15 21:32:43,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-15 21:32:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-15 21:32:43,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-15 21:32:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-15 21:32:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 21:32:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-15 21:32:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 21:32:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-15 21:32:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 21:32:43,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 21:32:43,662 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-15 21:32:43,796 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 21:32:43,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 21:32:43,891 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 21:32:43,891 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 21:32:43,905 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 21:32:43,905 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-15 21:32:43,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:32:43 BoogieIcfgContainer [2024-11-15 21:32:43,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 21:32:43,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 21:32:43,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 21:32:43,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 21:32:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:32:43" (1/3) ... [2024-11-15 21:32:43,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5504dc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:32:43, skipping insertion in model container [2024-11-15 21:32:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:32:43" (2/3) ... [2024-11-15 21:32:43,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5504dc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:32:43, skipping insertion in model container [2024-11-15 21:32:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:32:43" (3/3) ... [2024-11-15 21:32:43,913 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2024-11-15 21:32:43,926 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 21:32:43,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-15 21:32:43,927 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 21:32:43,961 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:32:44,004 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 21:32:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:32:44,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-15 21:32:44,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-15 21:32:44,079 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:44,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-11-15 21:32:44,101 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:44,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:44,260 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:44,260 INFO L132 ounterexampleChecker]: Examining path program with hash 48200318, occurence #1 [2024-11-15 21:32:44,260 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:44,260 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash 161413502, now seen corresponding path program 1 times [2024-11-15 21:32:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024960484] [2024-11-15 21:32:44,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024960484] [2024-11-15 21:32:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024960484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120437637] [2024-11-15 21:32:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:44,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:44,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:44,591 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:44,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:44,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:44,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:44,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 21:32:44,690 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-15 21:32:44,691 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-11-15 21:32:44,694 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,695 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:44,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:32:44,695 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:44,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:44,707 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:44,708 INFO L132 ounterexampleChecker]: Examining path program with hash -873602692, occurence #1 [2024-11-15 21:32:44,708 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:44,708 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 195036311, now seen corresponding path program 1 times [2024-11-15 21:32:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123578974] [2024-11-15 21:32:44,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123578974] [2024-11-15 21:32:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123578974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585486198] [2024-11-15 21:32:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:44,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:44,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:44,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:44,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 21:32:44,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:44,876 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:44,876 INFO L132 ounterexampleChecker]: Examining path program with hash 1490773931, occurence #1 [2024-11-15 21:32:44,876 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:44,876 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1474965690, now seen corresponding path program 1 times [2024-11-15 21:32:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735509534] [2024-11-15 21:32:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:44,917 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:32:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:44,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:32:44,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:32:44,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-15 21:32:44,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-15 21:32:44,953 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:44,953 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-11-15 21:32:44,954 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:32:44,954 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-15 21:32:44,970 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:32:44,984 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,992 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:44,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:32:44,993 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:44,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:45,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:45,163 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:45,163 INFO L132 ounterexampleChecker]: Examining path program with hash -360247326, occurence #1 [2024-11-15 21:32:45,163 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:45,163 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1835444612, now seen corresponding path program 1 times [2024-11-15 21:32:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674776757] [2024-11-15 21:32:45,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674776757] [2024-11-15 21:32:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674776757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:45,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615540822] [2024-11-15 21:32:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:45,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:45,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:45,237 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:45,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:45,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-15 21:32:45,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:45,364 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:45,364 INFO L132 ounterexampleChecker]: Examining path program with hash 432686964, occurence #1 [2024-11-15 21:32:45,364 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:45,364 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2065305628, now seen corresponding path program 1 times [2024-11-15 21:32:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844655127] [2024-11-15 21:32:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:45,384 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:32:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:45,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:32:45,412 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:32:45,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-15 21:32:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-15 21:32:45,414 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:45,414 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-11-15 21:32:45,414 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:32:45,414 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-15 21:32:45,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:32:45,437 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:45,444 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:45,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-11-15 21:32:45,445 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:45,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:45,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:45,719 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:45,720 INFO L132 ounterexampleChecker]: Examining path program with hash 1661091729, occurence #1 [2024-11-15 21:32:45,720 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:45,720 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:45,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1679848023, now seen corresponding path program 1 times [2024-11-15 21:32:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693586162] [2024-11-15 21:32:45,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693586162] [2024-11-15 21:32:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693586162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872076130] [2024-11-15 21:32:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:45,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:45,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:45,797 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:45,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:45,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-15 21:32:46,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:46,327 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:46,327 INFO L132 ounterexampleChecker]: Examining path program with hash -429540782, occurence #1 [2024-11-15 21:32:46,327 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:46,327 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash -750709441, now seen corresponding path program 1 times [2024-11-15 21:32:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604751424] [2024-11-15 21:32:46,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:46,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:46,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604751424] [2024-11-15 21:32:46,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604751424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:46,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:46,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:46,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511956598] [2024-11-15 21:32:46,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:46,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:46,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:46,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:46,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:46,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:46,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:46,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:47,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:47,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-15 21:32:47,297 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:47,297 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-11-15 21:32:47,299 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:47,301 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:47,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:32:47,301 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:47,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:47,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:47,313 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:47,314 INFO L132 ounterexampleChecker]: Examining path program with hash -1250567801, occurence #1 [2024-11-15 21:32:47,314 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:47,314 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1043105579, now seen corresponding path program 1 times [2024-11-15 21:32:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262615404] [2024-11-15 21:32:47,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262615404] [2024-11-15 21:32:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262615404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:47,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800378785] [2024-11-15 21:32:47,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:47,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:47,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:47,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:47,383 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:47,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:47,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-15 21:32:47,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:47,419 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:47,419 INFO L132 ounterexampleChecker]: Examining path program with hash 1676311061, occurence #1 [2024-11-15 21:32:47,419 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:47,419 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 375339577, now seen corresponding path program 1 times [2024-11-15 21:32:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67834684] [2024-11-15 21:32:47,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:47,441 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:32:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:47,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:32:47,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:32:47,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-15 21:32:47,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-15 21:32:47,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:47,469 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-11-15 21:32:47,469 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:32:47,469 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-15 21:32:47,485 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:32:47,488 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:47,495 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:47,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-11-15 21:32:47,496 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:47,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:47,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:47,771 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:47,771 INFO L132 ounterexampleChecker]: Examining path program with hash -1313871762, occurence #1 [2024-11-15 21:32:47,771 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:47,772 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1283009829, now seen corresponding path program 1 times [2024-11-15 21:32:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482624981] [2024-11-15 21:32:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482624981] [2024-11-15 21:32:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482624981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873804430] [2024-11-15 21:32:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:47,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:47,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:47,818 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:47,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:47,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-15 21:32:48,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:48,127 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:48,127 INFO L132 ounterexampleChecker]: Examining path program with hash -799481537, occurence #1 [2024-11-15 21:32:48,127 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:48,127 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 99258701, now seen corresponding path program 1 times [2024-11-15 21:32:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906683285] [2024-11-15 21:32:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:48,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906683285] [2024-11-15 21:32:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906683285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908268890] [2024-11-15 21:32:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:48,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:48,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:48,250 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:48,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:48,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:48,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:51,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:51,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-15 21:32:51,620 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:51,621 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork0 was SAFE (1/5) [2024-11-15 21:32:51,623 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:51,624 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:51,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork0 ======== [2024-11-15 21:32:51,626 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:51,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:51,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:51,634 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:51,634 INFO L132 ounterexampleChecker]: Examining path program with hash 1002450048, occurence #1 [2024-11-15 21:32:51,634 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:51,634 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:51,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash -536579816, now seen corresponding path program 1 times [2024-11-15 21:32:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450318099] [2024-11-15 21:32:51,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450318099] [2024-11-15 21:32:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450318099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:51,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062106369] [2024-11-15 21:32:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:51,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:51,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-15 21:32:51,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:51,794 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:51,794 INFO L132 ounterexampleChecker]: Examining path program with hash -727367485, occurence #1 [2024-11-15 21:32:51,795 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:51,795 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:51,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash 42736538, now seen corresponding path program 1 times [2024-11-15 21:32:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:51,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136583862] [2024-11-15 21:32:51,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136583862] [2024-11-15 21:32:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136583862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:51,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:51,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231417277] [2024-11-15 21:32:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:51,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:51,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:51,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:51,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:51,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:51,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:54,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:54,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-15 21:32:54,418 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:54,419 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork0 was SAFE (2/5) [2024-11-15 21:32:54,422 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:54,422 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:54,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork0 ======== [2024-11-15 21:32:54,423 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:54,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:54,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:54,426 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:54,426 INFO L132 ounterexampleChecker]: Examining path program with hash -675199560, occurence #1 [2024-11-15 21:32:54,426 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:54,427 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1513580976, now seen corresponding path program 1 times [2024-11-15 21:32:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780129145] [2024-11-15 21:32:54,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780129145] [2024-11-15 21:32:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780129145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:54,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161782582] [2024-11-15 21:32:54,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:54,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:54,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:54,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:54,458 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:54,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:54,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:55,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-15 21:32:55,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:55,555 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:55,557 INFO L132 ounterexampleChecker]: Examining path program with hash 1979280589, occurence #1 [2024-11-15 21:32:55,557 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:55,557 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1498426290, now seen corresponding path program 1 times [2024-11-15 21:32:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405092931] [2024-11-15 21:32:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405092931] [2024-11-15 21:32:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405092931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:55,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:55,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474534196] [2024-11-15 21:32:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:55,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:55,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:55,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:55,617 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:55,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:55,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:55,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:56,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-15 21:32:56,340 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:56,341 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of4ForFork0 was SAFE (3/5) [2024-11-15 21:32:56,342 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:56,343 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:56,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork0 ======== [2024-11-15 21:32:56,343 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:56,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:56,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:56,347 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:56,347 INFO L132 ounterexampleChecker]: Examining path program with hash -1464588635, occurence #1 [2024-11-15 21:32:56,347 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:56,347 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:56,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1649671243, now seen corresponding path program 1 times [2024-11-15 21:32:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480269569] [2024-11-15 21:32:56,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:56,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:56,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480269569] [2024-11-15 21:32:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480269569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617061782] [2024-11-15 21:32:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:56,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:56,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:56,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:56,379 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:56,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:56,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-15 21:32:56,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:56,483 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:56,483 INFO L132 ounterexampleChecker]: Examining path program with hash 1566756498, occurence #1 [2024-11-15 21:32:56,483 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:56,483 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:56,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash 266128392, now seen corresponding path program 1 times [2024-11-15 21:32:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180845451] [2024-11-15 21:32:56,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:56,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:56,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180845451] [2024-11-15 21:32:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180845451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:56,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895792951] [2024-11-15 21:32:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:56,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:56,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:56,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:56,539 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:56,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:56,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:56,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:58,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:32:58,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-15 21:32:58,371 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:58,372 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork0 was SAFE (4/5) [2024-11-15 21:32:58,373 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:58,373 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:58,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:32:58,374 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:58,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:58,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:58,380 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:58,380 INFO L132 ounterexampleChecker]: Examining path program with hash 1646694627, occurence #1 [2024-11-15 21:32:58,380 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:58,380 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:58,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1664106146, now seen corresponding path program 1 times [2024-11-15 21:32:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281546479] [2024-11-15 21:32:58,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:58,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281546479] [2024-11-15 21:32:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281546479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450074976] [2024-11-15 21:32:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:58,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:58,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:58,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:32:58,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-15 21:32:58,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:32:58,588 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:58,588 INFO L132 ounterexampleChecker]: Examining path program with hash -818835467, occurence #1 [2024-11-15 21:32:58,588 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:58,588 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 633640882, now seen corresponding path program 1 times [2024-11-15 21:32:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143058062] [2024-11-15 21:32:58,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:58,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:32:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:32:58,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:32:58,635 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:32:58,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-15 21:32:58,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-15 21:32:58,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:32:58,637 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (5/5) [2024-11-15 21:32:58,637 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:32:58,637 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-15 21:32:58,657 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:32:58,659 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:58,667 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:32:58,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of5ForFork0 ======== [2024-11-15 21:32:58,667 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:32:58,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:32:58,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:32:58,884 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:32:58,884 INFO L132 ounterexampleChecker]: Examining path program with hash 316332266, occurence #1 [2024-11-15 21:32:58,884 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:32:58,884 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:32:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:32:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -758522953, now seen corresponding path program 1 times [2024-11-15 21:32:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:32:58,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940741498] [2024-11-15 21:32:58,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:32:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:32:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:32:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:32:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:32:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940741498] [2024-11-15 21:32:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940741498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:32:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:32:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:32:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184265021] [2024-11-15 21:32:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:32:58,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:32:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:32:58,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:32:58,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:32:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:32:58,913 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:32:58,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:32:58,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:00,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-15 21:33:00,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:33:00,501 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:00,502 INFO L132 ounterexampleChecker]: Examining path program with hash 1615656849, occurence #1 [2024-11-15 21:33:00,502 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:00,502 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:00,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash -223761216, now seen corresponding path program 1 times [2024-11-15 21:33:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458510730] [2024-11-15 21:33:00,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458510730] [2024-11-15 21:33:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458510730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:00,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102158412] [2024-11-15 21:33:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:00,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:00,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:00,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:00,564 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:00,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:00,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:00,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:12,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:33:12,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-15 21:33:12,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:33:12,059 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread2of5ForFork0 was SAFE (1/6) [2024-11-15 21:33:12,061 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:12,062 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:33:12,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of5ForFork0 ======== [2024-11-15 21:33:12,062 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:12,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:33:12,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:33:12,065 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:12,065 INFO L132 ounterexampleChecker]: Examining path program with hash -1906397295, occurence #1 [2024-11-15 21:33:12,065 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:12,065 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:12,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1318449428, now seen corresponding path program 1 times [2024-11-15 21:33:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374304292] [2024-11-15 21:33:12,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374304292] [2024-11-15 21:33:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374304292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447174839] [2024-11-15 21:33:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:12,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:12,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:12,089 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:12,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:12,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-15 21:33:27,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:33:27,145 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:27,145 INFO L132 ounterexampleChecker]: Examining path program with hash -381883447, occurence #1 [2024-11-15 21:33:27,145 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:27,145 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1890835045, now seen corresponding path program 1 times [2024-11-15 21:33:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637096241] [2024-11-15 21:33:27,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:27,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637096241] [2024-11-15 21:33:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637096241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947604940] [2024-11-15 21:33:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:27,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:27,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:27,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:27,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:27,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:27,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:32,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:33:32,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-15 21:33:32,365 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:33:32,366 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of5ForFork0 was SAFE (2/6) [2024-11-15 21:33:32,367 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:32,368 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:33:32,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:33:32,368 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:32,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:33:32,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:33:32,376 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:32,376 INFO L132 ounterexampleChecker]: Examining path program with hash 1911944460, occurence #1 [2024-11-15 21:33:32,376 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:32,376 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:32,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1938878927, now seen corresponding path program 1 times [2024-11-15 21:33:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:32,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961854917] [2024-11-15 21:33:32,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961854917] [2024-11-15 21:33:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961854917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:32,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469366196] [2024-11-15 21:33:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:32,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:32,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:32,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:32,422 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:32,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-15 21:33:32,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:33:32,475 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:32,475 INFO L132 ounterexampleChecker]: Examining path program with hash -726644249, occurence #1 [2024-11-15 21:33:32,475 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:32,475 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 208712952, now seen corresponding path program 1 times [2024-11-15 21:33:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747886326] [2024-11-15 21:33:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:33:32,490 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:33:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:33:32,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:33:32,506 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:33:32,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-15 21:33:32,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-15 21:33:32,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:33:32,507 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/6) [2024-11-15 21:33:32,508 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:33:32,508 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-15 21:33:32,525 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:33:32,527 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:32,537 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:33:32,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread6of6ForFork0 ======== [2024-11-15 21:33:32,537 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@34f03269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:33:32,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:33:32,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:33:32,905 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:32,905 INFO L132 ounterexampleChecker]: Examining path program with hash -925370560, occurence #1 [2024-11-15 21:33:32,905 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:32,905 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:32,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1953924119, now seen corresponding path program 1 times [2024-11-15 21:33:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:32,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31295914] [2024-11-15 21:33:32,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31295914] [2024-11-15 21:33:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31295914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730155703] [2024-11-15 21:33:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:32,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:32,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:32,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:32,942 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:33,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-15 21:33:33,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:33:33,327 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:33:33,328 INFO L132 ounterexampleChecker]: Examining path program with hash -358282326, occurence #1 [2024-11-15 21:33:33,328 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:33:33,328 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:33:33,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:33:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1023310968, now seen corresponding path program 1 times [2024-11-15 21:33:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:33:33,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266724506] [2024-11-15 21:33:33,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:33:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:33:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:33:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:33:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:33:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266724506] [2024-11-15 21:33:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266724506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:33:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:33:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:33:33,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496449624] [2024-11-15 21:33:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:33:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:33:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:33:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:33:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:33:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:33:33,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:33:33,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:33:33,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:33:33,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.