./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-25 14:50:59,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 14:50:59,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-25 14:50:59,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 14:50:59,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 14:50:59,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 14:50:59,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 14:50:59,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 14:50:59,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-25 14:50:59,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-25 14:50:59,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 14:50:59,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 14:50:59,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 14:50:59,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 14:50:59,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-25 14:50:59,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 14:50:59,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 14:50:59,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 14:50:59,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 14:50:59,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-25 14:50:59,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-25 14:50:59,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-25 14:50:59,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 14:50:59,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 14:50:59,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 14:50:59,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 14:50:59,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 14:50:59,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 14:50:59,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-25 14:50:59,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-25 14:50:59,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 14:50:59,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 14:50:59,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-25 14:50:59,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-25 14:50:59,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 14:50:59,881 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-25 14:50:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-25 14:50:59,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-25 14:50:59,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-25 14:50:59,884 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-25 14:50:59,884 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-25 14:50:59,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2024-10-25 14:51:00,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 14:51:00,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 14:51:00,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 14:51:00,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 14:51:00,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 14:51:00,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-10-25 14:51:01,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 14:51:01,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 14:51:01,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-10-25 14:51:01,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a63f34d52/4a8b06ba3b8f42908fa905037a9d3a4c/FLAGaebf619dc [2024-10-25 14:51:01,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a63f34d52/4a8b06ba3b8f42908fa905037a9d3a4c [2024-10-25 14:51:01,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 14:51:01,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 14:51:01,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 14:51:01,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 14:51:01,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 14:51:01,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:51:01" (1/1) ... [2024-10-25 14:51:01,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6569a07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:01, skipping insertion in model container [2024-10-25 14:51:01,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:51:01" (1/1) ... [2024-10-25 14:51:01,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 14:51:02,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2024-10-25 14:51:02,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 14:51:02,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 14:51:02,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2024-10-25 14:51:02,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 14:51:02,221 INFO L204 MainTranslator]: Completed translation [2024-10-25 14:51:02,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02 WrapperNode [2024-10-25 14:51:02,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 14:51:02,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 14:51:02,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 14:51:02,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 14:51:02,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,263 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-10-25 14:51:02,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 14:51:02,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 14:51:02,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 14:51:02,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 14:51:02,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 14:51:02,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 14:51:02,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 14:51:02,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 14:51:02,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (1/1) ... [2024-10-25 14:51:02,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 14:51:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:02,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:02,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-25 14:51:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-25 14:51:02,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-25 14:51:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 14:51:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-25 14:51:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-25 14:51:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 14:51:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 14:51:02,381 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-25 14:51:02,528 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 14:51:02,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 14:51:02,753 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-25 14:51:02,754 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 14:51:02,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 14:51:02,929 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-25 14:51:02,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:51:02 BoogieIcfgContainer [2024-10-25 14:51:02,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 14:51:02,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-25 14:51:02,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-25 14:51:02,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-25 14:51:02,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:51:01" (1/3) ... [2024-10-25 14:51:02,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e294d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:51:02, skipping insertion in model container [2024-10-25 14:51:02,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:51:02" (2/3) ... [2024-10-25 14:51:02,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e294d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:51:02, skipping insertion in model container [2024-10-25 14:51:02,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:51:02" (3/3) ... [2024-10-25 14:51:02,939 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2024-10-25 14:51:02,951 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-25 14:51:02,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-25 14:51:02,951 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-25 14:51:02,985 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-25 14:51:03,030 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:03,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:03,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-25 14:51:03,073 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:03,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:03,094 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:03,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:03,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:03,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 827267552, now seen corresponding path program 1 times [2024-10-25 14:51:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685087397] [2024-10-25 14:51:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 14:51:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685087397] [2024-10-25 14:51:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685087397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045439177] [2024-10-25 14:51:03,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:03,695 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:03,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-25 14:51:03,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-25 14:51:03,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:03,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 550581246, now seen corresponding path program 1 times [2024-10-25 14:51:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597768729] [2024-10-25 14:51:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:03,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:03,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:03,992 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:03,993 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:03,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:03,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-25 14:51:04,004 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-25 14:51:04,006 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:04,006 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-25 14:51:04,028 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-25 14:51:04,034 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:04,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:04,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:04,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:04,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-25 14:51:04,042 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:04,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:04,045 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:04,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:04,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:04,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 334895274, now seen corresponding path program 1 times [2024-10-25 14:51:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:04,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952675816] [2024-10-25 14:51:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 14:51:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952675816] [2024-10-25 14:51:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952675816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:04,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:04,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348335447] [2024-10-25 14:51:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:04,584 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:04,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 14:51:04,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-25 14:51:05,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash 103946751, now seen corresponding path program 1 times [2024-10-25 14:51:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857036934] [2024-10-25 14:51:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 14:51:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857036934] [2024-10-25 14:51:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857036934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983867756] [2024-10-25 14:51:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,384 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:05,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-25 14:51:05,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:05,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-25 14:51:05,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1624501756, now seen corresponding path program 1 times [2024-10-25 14:51:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829157642] [2024-10-25 14:51:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 14:51:05,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829157642] [2024-10-25 14:51:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829157642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:05,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:05,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 14:51:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811454766] [2024-10-25 14:51:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:05,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 14:51:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 14:51:05,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 14:51:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,806 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 14:51:05,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:05,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:05,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-25 14:51:05,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:05,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1512302075, now seen corresponding path program 1 times [2024-10-25 14:51:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:05,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221468966] [2024-10-25 14:51:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:05,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:05,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:05,951 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:05,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:05,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-25 14:51:05,954 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:05,954 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:05,954 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-25 14:51:05,976 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-25 14:51:05,979 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:05,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-25 14:51:05,988 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:05,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:05,989 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:05,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:06,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:06,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash 307488905, now seen corresponding path program 1 times [2024-10-25 14:51:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096583484] [2024-10-25 14:51:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 14:51:06,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096583484] [2024-10-25 14:51:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096583484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:06,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723716507] [2024-10-25 14:51:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:06,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:06,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 14:51:06,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:07,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-25 14:51:07,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:07,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2114379075, now seen corresponding path program 1 times [2024-10-25 14:51:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249006601] [2024-10-25 14:51:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 14:51:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249006601] [2024-10-25 14:51:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249006601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267736049] [2024-10-25 14:51:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:07,994 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 14:51:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:08,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-25 14:51:08,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1088564743, now seen corresponding path program 1 times [2024-10-25 14:51:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539393618] [2024-10-25 14:51:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 14:51:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539393618] [2024-10-25 14:51:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539393618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054120274] [2024-10-25 14:51:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:08,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:08,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-25 14:51:08,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:08,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:08,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-25 14:51:08,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:08,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2071151197, now seen corresponding path program 1 times [2024-10-25 14:51:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504851808] [2024-10-25 14:51:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:08,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:08,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:08,716 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:08,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:08,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:08,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-25 14:51:08,718 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:08,720 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:08,720 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-25 14:51:08,737 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-25 14:51:08,740 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:08,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:08,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:08,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-25 14:51:08,745 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:08,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:08,746 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:08,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:09,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -509000272, now seen corresponding path program 1 times [2024-10-25 14:51:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399617104] [2024-10-25 14:51:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 14:51:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399617104] [2024-10-25 14:51:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399617104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916891013] [2024-10-25 14:51:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:09,631 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-25 14:51:09,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-25 14:51:11,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1715545970, now seen corresponding path program 1 times [2024-10-25 14:51:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2595927] [2024-10-25 14:51:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 14:51:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2595927] [2024-10-25 14:51:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2595927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726001971] [2024-10-25 14:51:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:11,648 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-10-25 14:51:11,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-25 14:51:11,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1522438833, now seen corresponding path program 1 times [2024-10-25 14:51:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018903257] [2024-10-25 14:51:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-25 14:51:12,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:12,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018903257] [2024-10-25 14:51:12,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018903257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:12,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088796497] [2024-10-25 14:51:12,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:12,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:12,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:12,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:12,123 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:12,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) 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-10-25 14:51:12,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:12,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:12,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:12,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-25 14:51:12,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1606880661, now seen corresponding path program 1 times [2024-10-25 14:51:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066098223] [2024-10-25 14:51:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:12,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:12,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:12,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:12,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:12,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-25 14:51:12,455 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:12,455 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:12,455 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-25 14:51:12,479 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-25 14:51:12,483 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:12,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:12,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-25 14:51:12,510 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:12,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:12,510 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:12,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:13,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:13,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1423158086, now seen corresponding path program 1 times [2024-10-25 14:51:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934975191] [2024-10-25 14:51:13,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 14:51:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934975191] [2024-10-25 14:51:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934975191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:13,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734035440] [2024-10-25 14:51:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:13,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:13,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:13,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 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-10-25 14:51:13,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-25 14:51:16,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:16,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1893586578, now seen corresponding path program 1 times [2024-10-25 14:51:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213491584] [2024-10-25 14:51:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-25 14:51:16,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213491584] [2024-10-25 14:51:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213491584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:16,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:16,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302075236] [2024-10-25 14:51:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:16,391 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-10-25 14:51:16,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-25 14:51:16,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:16,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash 936158212, now seen corresponding path program 1 times [2024-10-25 14:51:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210880755] [2024-10-25 14:51:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-25 14:51:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210880755] [2024-10-25 14:51:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210880755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184081029] [2024-10-25 14:51:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:17,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:17,123 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-25 14:51:17,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:17,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:17,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-25 14:51:17,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash 324684599, now seen corresponding path program 1 times [2024-10-25 14:51:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748259953] [2024-10-25 14:51:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:17,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:17,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:17,634 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:17,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:17,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-25 14:51:17,638 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:17,638 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:17,638 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-25 14:51:17,661 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-25 14:51:17,666 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:17,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:17,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:17,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:17,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-25 14:51:17,671 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:17,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:17,672 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:17,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:18,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1411927726, now seen corresponding path program 1 times [2024-10-25 14:51:18,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:18,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224294088] [2024-10-25 14:51:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-25 14:51:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224294088] [2024-10-25 14:51:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224294088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:18,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819179253] [2024-10-25 14:51:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:18,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:18,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-10-25 14:51:18,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-25 14:51:22,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1426017486, now seen corresponding path program 1 times [2024-10-25 14:51:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146232430] [2024-10-25 14:51:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-25 14:51:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146232430] [2024-10-25 14:51:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146232430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:22,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966334016] [2024-10-25 14:51:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,336 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-25 14:51:22,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-25 14:51:22,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -621532253, now seen corresponding path program 1 times [2024-10-25 14:51:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632748656] [2024-10-25 14:51:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-25 14:51:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632748656] [2024-10-25 14:51:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632748656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522133839] [2024-10-25 14:51:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:23,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:23,180 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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-10-25 14:51:23,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:23,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:23,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-25 14:51:23,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 673119660, now seen corresponding path program 1 times [2024-10-25 14:51:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298918335] [2024-10-25 14:51:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:23,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:23,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:23,924 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:23,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:23,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:23,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-25 14:51:23,926 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:23,926 WARN L239 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:23,926 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-10-25 14:51:23,953 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-10-25 14:51:23,955 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:23,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:23,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-25 14:51:23,960 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:23,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:23,961 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:23,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:25,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1203811257, now seen corresponding path program 1 times [2024-10-25 14:51:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611853091] [2024-10-25 14:51:25,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-25 14:51:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611853091] [2024-10-25 14:51:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611853091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:25,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:25,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655217148] [2024-10-25 14:51:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:25,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:25,588 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:25,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-10-25 14:51:25,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-25 14:51:29,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -82926653, now seen corresponding path program 1 times [2024-10-25 14:51:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321964477] [2024-10-25 14:51:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 14:51:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321964477] [2024-10-25 14:51:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321964477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:30,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:30,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205420365] [2024-10-25 14:51:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:30,068 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:30,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-10-25 14:51:30,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:30,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:30,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-25 14:51:30,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:30,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash -132184043, now seen corresponding path program 1 times [2024-10-25 14:51:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180508460] [2024-10-25 14:51:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-25 14:51:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180508460] [2024-10-25 14:51:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180508460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065216227] [2024-10-25 14:51:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:31,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 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-10-25 14:51:31,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:31,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:31,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:31,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-25 14:51:31,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:31,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash -931868976, now seen corresponding path program 1 times [2024-10-25 14:51:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291375290] [2024-10-25 14:51:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:31,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:31,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:31,905 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:31,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:31,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:31,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-25 14:51:31,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:31,907 WARN L239 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:31,907 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-10-25 14:51:31,936 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-10-25 14:51:31,939 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:31,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:31,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:31,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-10-25 14:51:31,944 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:31,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:31,945 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:31,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:33,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -650346004, now seen corresponding path program 1 times [2024-10-25 14:51:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:33,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917251681] [2024-10-25 14:51:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-25 14:51:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917251681] [2024-10-25 14:51:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917251681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009651293] [2024-10-25 14:51:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:34,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:34,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:34,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-10-25 14:51:34,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:39,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-25 14:51:39,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:39,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 202328148, now seen corresponding path program 1 times [2024-10-25 14:51:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783696890] [2024-10-25 14:51:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-25 14:51:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783696890] [2024-10-25 14:51:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783696890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196231483] [2024-10-25 14:51:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:39,137 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:39,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-10-25 14:51:39,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:39,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:40,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-25 14:51:40,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 513100616, now seen corresponding path program 1 times [2024-10-25 14:51:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65492451] [2024-10-25 14:51:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-25 14:51:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65492451] [2024-10-25 14:51:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65492451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059181871] [2024-10-25 14:51:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:40,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:40,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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-10-25 14:51:40,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:40,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:40,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-25 14:51:41,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -682133538, now seen corresponding path program 1 times [2024-10-25 14:51:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387728032] [2024-10-25 14:51:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:41,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:41,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:41,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:41,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:41,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:41,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-25 14:51:41,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:41,459 WARN L239 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:41,459 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-10-25 14:51:41,486 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-10-25 14:51:41,488 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:41,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:41,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-25 14:51:41,493 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:41,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:41,494 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:41,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:44,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash 339370176, now seen corresponding path program 1 times [2024-10-25 14:51:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110554402] [2024-10-25 14:51:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-25 14:51:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110554402] [2024-10-25 14:51:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110554402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632591461] [2024-10-25 14:51:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:44,115 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 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-10-25 14:51:44,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-25 14:51:49,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -460246704, now seen corresponding path program 1 times [2024-10-25 14:51:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522626753] [2024-10-25 14:51:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-25 14:51:49,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522626753] [2024-10-25 14:51:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522626753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:49,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:49,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120397651] [2024-10-25 14:51:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:51:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:51:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:51:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:50,000 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:50,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10-25 14:51:50,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:50,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-25 14:51:50,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1905204022, now seen corresponding path program 1 times [2024-10-25 14:51:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941526477] [2024-10-25 14:51:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-25 14:51:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941526477] [2024-10-25 14:51:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941526477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:51:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557636619] [2024-10-25 14:51:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:51,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:51:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:51:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:51:51,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:51,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:51,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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-10-25 14:51:51,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:51,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:51,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:51:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:51:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-25 14:51:52,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1823067676, now seen corresponding path program 1 times [2024-10-25 14:51:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485103971] [2024-10-25 14:51:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:52,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:51:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:51:52,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:51:52,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:51:52,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:51:52,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:51:52,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-25 14:51:52,792 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:51:52,792 WARN L239 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:51:52,792 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-10-25 14:51:52,818 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-10-25 14:51:52,820 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:51:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:51:52,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:51:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-10-25 14:51:52,823 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:51:52,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:51:52,824 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:51:52,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:51:55,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:51:55,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:51:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1666332634, now seen corresponding path program 1 times [2024-10-25 14:51:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:51:55,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306089150] [2024-10-25 14:51:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:51:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:51:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:51:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-25 14:51:55,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:51:55,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306089150] [2024-10-25 14:51:55,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306089150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:51:55,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:51:55,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:51:55,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068455445] [2024-10-25 14:51:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:51:55,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:51:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:51:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:51:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:51:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:51:55,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:51:55,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 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-10-25 14:51:55,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-25 14:52:02,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 309261292, now seen corresponding path program 1 times [2024-10-25 14:52:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080329674] [2024-10-25 14:52:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-25 14:52:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080329674] [2024-10-25 14:52:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080329674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054891783] [2024-10-25 14:52:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:52:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:52:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:52:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:02,458 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:02,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-10-25 14:52:02,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:02,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:03,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-25 14:52:03,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 80909369, now seen corresponding path program 1 times [2024-10-25 14:52:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:03,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999884861] [2024-10-25 14:52:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-25 14:52:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999884861] [2024-10-25 14:52:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999884861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168345485] [2024-10-25 14:52:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:03,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:52:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:52:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:52:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:03,940 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 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-10-25 14:52:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:52:05,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-25 14:52:05,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -798268924, now seen corresponding path program 1 times [2024-10-25 14:52:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549765398] [2024-10-25 14:52:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:05,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:52:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:05,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:52:05,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:52:05,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:52:05,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:52:05,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-25 14:52:05,460 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:52:05,460 WARN L239 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:52:05,460 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-10-25 14:52:05,492 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-10-25 14:52:05,495 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:05,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:52:05,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:52:05,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:52:05,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-10-25 14:52:05,500 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:52:05,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:52:05,501 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:05,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:52:08,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash 298844149, now seen corresponding path program 1 times [2024-10-25 14:52:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576535649] [2024-10-25 14:52:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-25 14:52:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576535649] [2024-10-25 14:52:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576535649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:52:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573000552] [2024-10-25 14:52:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:52:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:52:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:52:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:08,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:08,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 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-10-25 14:52:08,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:16,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-25 14:52:16,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 222769458, now seen corresponding path program 1 times [2024-10-25 14:52:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117074591] [2024-10-25 14:52:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-25 14:52:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117074591] [2024-10-25 14:52:16,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117074591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:16,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643103689] [2024-10-25 14:52:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:52:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:52:16,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:52:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:16,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:16,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-10-25 14:52:16,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:16,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-25 14:52:18,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:18,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash 932748668, now seen corresponding path program 1 times [2024-10-25 14:52:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960084253] [2024-10-25 14:52:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-25 14:52:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960084253] [2024-10-25 14:52:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960084253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:18,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:18,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193673718] [2024-10-25 14:52:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:18,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:52:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:52:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:52:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:18,381 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 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-10-25 14:52:18,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:18,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:18,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:52:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-25 14:52:20,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:20,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash -587040796, now seen corresponding path program 1 times [2024-10-25 14:52:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:20,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006133049] [2024-10-25 14:52:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:20,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:52:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:20,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:52:20,466 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:52:20,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:52:20,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:52:20,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-25 14:52:20,470 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:52:20,470 WARN L239 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:52:20,470 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-10-25 14:52:20,503 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-10-25 14:52:20,506 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:20,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:52:20,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:52:20,508 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:52:20,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-25 14:52:20,513 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:52:20,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:52:20,514 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:20,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:52:24,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 305488288, now seen corresponding path program 1 times [2024-10-25 14:52:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446460708] [2024-10-25 14:52:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-25 14:52:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446460708] [2024-10-25 14:52:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446460708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:52:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084493406] [2024-10-25 14:52:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:52:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:52:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:52:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:24,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:24,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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-10-25 14:52:24,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-25 14:52:33,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:33,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 934702232, now seen corresponding path program 1 times [2024-10-25 14:52:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337558763] [2024-10-25 14:52:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-10-25 14:52:33,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337558763] [2024-10-25 14:52:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337558763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503919694] [2024-10-25 14:52:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:33,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:52:33,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:52:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:52:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:33,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-10-25 14:52:33,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:33,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:35,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-25 14:52:35,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1542670264, now seen corresponding path program 1 times [2024-10-25 14:52:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021137134] [2024-10-25 14:52:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-25 14:52:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021137134] [2024-10-25 14:52:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021137134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:35,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57705317] [2024-10-25 14:52:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:52:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:52:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:52:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:35,496 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:35,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 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-10-25 14:52:35,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:35,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:35,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:52:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-25 14:52:37,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:37,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1444092011, now seen corresponding path program 1 times [2024-10-25 14:52:37,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:37,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855759935] [2024-10-25 14:52:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:37,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:52:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:37,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:52:37,959 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:52:37,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:52:37,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:52:37,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-25 14:52:37,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:52:37,961 WARN L239 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:52:37,961 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-10-25 14:52:37,998 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-10-25 14:52:38,001 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:38,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:52:38,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:52:38,005 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:52:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-10-25 14:52:38,010 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:52:38,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:52:38,011 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:38,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:52:42,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -735976806, now seen corresponding path program 1 times [2024-10-25 14:52:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790555878] [2024-10-25 14:52:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-25 14:52:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790555878] [2024-10-25 14:52:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790555878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:52:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135352297] [2024-10-25 14:52:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:52:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:52:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:52:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:42,311 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 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-10-25 14:52:42,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-25 14:52:52,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1642964025, now seen corresponding path program 1 times [2024-10-25 14:52:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735827131] [2024-10-25 14:52:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-25 14:52:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735827131] [2024-10-25 14:52:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735827131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732356209] [2024-10-25 14:52:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:52:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:52:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:52:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:53,136 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-10-25 14:52:53,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:53,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:54,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-25 14:52:54,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1810359238, now seen corresponding path program 1 times [2024-10-25 14:52:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90848312] [2024-10-25 14:52:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:52:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-25 14:52:55,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:52:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90848312] [2024-10-25 14:52:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90848312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:52:55,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:52:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:52:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139293478] [2024-10-25 14:52:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:52:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:52:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:52:55,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:52:55,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:52:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:55,105 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:52:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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-10-25 14:52:55,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:55,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:55,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:52:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:52:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:52:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-25 14:52:57,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:52:57,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:52:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 962664203, now seen corresponding path program 1 times [2024-10-25 14:52:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:52:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536856898] [2024-10-25 14:52:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:52:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:52:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:57,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:52:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:52:57,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:52:57,887 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:52:57,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:52:57,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:52:57,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-25 14:52:57,889 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:52:57,889 WARN L239 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:52:57,889 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-10-25 14:52:57,921 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-10-25 14:52:57,923 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:57,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:52:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:52:57,925 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:52:57,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-25 14:52:57,929 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:52:57,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:52:57,930 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:52:57,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:53:02,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:02,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 560901974, now seen corresponding path program 1 times [2024-10-25 14:53:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323614268] [2024-10-25 14:53:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-25 14:53:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323614268] [2024-10-25 14:53:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323614268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:53:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858315527] [2024-10-25 14:53:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:53:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:53:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:53:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:02,875 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:02,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-10-25 14:53:02,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-25 14:53:15,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:15,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1209168684, now seen corresponding path program 1 times [2024-10-25 14:53:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390438922] [2024-10-25 14:53:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-25 14:53:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390438922] [2024-10-25 14:53:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390438922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:15,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:15,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:53:15,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746166504] [2024-10-25 14:53:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:15,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:53:15,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:53:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:53:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:15,716 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:15,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-10-25 14:53:15,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:15,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:17,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-25 14:53:17,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:17,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1920990826, now seen corresponding path program 1 times [2024-10-25 14:53:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676021480] [2024-10-25 14:53:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-10-25 14:53:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676021480] [2024-10-25 14:53:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676021480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:53:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655028249] [2024-10-25 14:53:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:18,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:53:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:53:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:53:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:18,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:18,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 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-10-25 14:53:18,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:18,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:18,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:53:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-25 14:53:21,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:21,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1864079643, now seen corresponding path program 1 times [2024-10-25 14:53:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968530611] [2024-10-25 14:53:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:53:21,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:53:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:53:21,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:53:21,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:53:21,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:53:21,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:53:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-25 14:53:21,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 14:53:21,927 WARN L239 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:53:21,927 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-10-25 14:53:21,967 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-10-25 14:53:21,970 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:53:21,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:53:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:53:21,973 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:53:21,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-10-25 14:53:21,977 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:53:21,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:53:21,977 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:53:21,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:53:27,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1528365213, now seen corresponding path program 1 times [2024-10-25 14:53:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295092792] [2024-10-25 14:53:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-25 14:53:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295092792] [2024-10-25 14:53:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295092792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:53:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495182567] [2024-10-25 14:53:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:53:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:27,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:53:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:53:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:27,574 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:27,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 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-10-25 14:53:27,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:41,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-25 14:53:41,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -948392695, now seen corresponding path program 1 times [2024-10-25 14:53:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296260861] [2024-10-25 14:53:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-25 14:53:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296260861] [2024-10-25 14:53:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296260861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:41,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:53:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570271008] [2024-10-25 14:53:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:41,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:53:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:53:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:53:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:41,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:41,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-10-25 14:53:41,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:41,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:43,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-25 14:53:43,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1032447633, now seen corresponding path program 2 times [2024-10-25 14:53:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749091808] [2024-10-25 14:53:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-10-25 14:53:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749091808] [2024-10-25 14:53:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749091808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:43,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:43,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:53:43,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964248900] [2024-10-25 14:53:43,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:53:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:53:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:53:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:43,799 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:43,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 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-10-25 14:53:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:53:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:53:48,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-25 14:53:48,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -467571179, now seen corresponding path program 1 times [2024-10-25 14:53:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324327438] [2024-10-25 14:53:48,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:53:48,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:53:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:53:48,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:53:48,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:53:48,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:53:48,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:53:48,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-25 14:53:48,210 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:53:48,210 WARN L239 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:53:48,210 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-10-25 14:53:48,251 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-10-25 14:53:48,254 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:53:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:53:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:53:48,257 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:53:48,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-25 14:53:48,260 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:53:48,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:53:48,261 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:53:48,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:53:54,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:53:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:53:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2107108220, now seen corresponding path program 1 times [2024-10-25 14:53:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:53:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103834473] [2024-10-25 14:53:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:53:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:53:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:53:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-25 14:53:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:53:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103834473] [2024-10-25 14:53:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103834473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:53:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:53:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:53:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264787880] [2024-10-25 14:53:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:53:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:53:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:53:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:53:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:53:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:53:54,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:53:54,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 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-10-25 14:53:54,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-25 14:54:10,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -862419035, now seen corresponding path program 1 times [2024-10-25 14:54:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943913155] [2024-10-25 14:54:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-10-25 14:54:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943913155] [2024-10-25 14:54:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943913155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:10,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:10,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:54:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904085744] [2024-10-25 14:54:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:10,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:54:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:54:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:54:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:10,547 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:10,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-10-25 14:54:10,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:10,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-25 14:54:12,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1494822319, now seen corresponding path program 2 times [2024-10-25 14:54:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132684052] [2024-10-25 14:54:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-10-25 14:54:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:12,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132684052] [2024-10-25 14:54:12,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132684052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:12,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:54:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391955111] [2024-10-25 14:54:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:12,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:54:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:54:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:54:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:12,958 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 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-10-25 14:54:12,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:12,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:12,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:54:17,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-25 14:54:17,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 377782306, now seen corresponding path program 1 times [2024-10-25 14:54:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142438425] [2024-10-25 14:54:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:54:17,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:54:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:54:17,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:54:17,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:54:17,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:54:17,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:54:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-25 14:54:17,838 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:54:17,839 WARN L239 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:54:17,839 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-10-25 14:54:17,892 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-10-25 14:54:17,895 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:54:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:54:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:54:17,897 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:54:17,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-25 14:54:17,901 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:54:17,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:54:17,902 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:54:17,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:54:25,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 707856540, now seen corresponding path program 1 times [2024-10-25 14:54:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900685595] [2024-10-25 14:54:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-25 14:54:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900685595] [2024-10-25 14:54:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900685595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:54:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068957513] [2024-10-25 14:54:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:54:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:54:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:54:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:25,103 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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-10-25 14:54:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:42,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-25 14:54:42,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash 57446358, now seen corresponding path program 1 times [2024-10-25 14:54:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630549554] [2024-10-25 14:54:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-25 14:54:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630549554] [2024-10-25 14:54:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630549554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:54:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984922809] [2024-10-25 14:54:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:54:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:54:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:54:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:42,325 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-10-25 14:54:42,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:42,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:44,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-25 14:54:44,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:44,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1357919902, now seen corresponding path program 2 times [2024-10-25 14:54:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396514882] [2024-10-25 14:54:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-10-25 14:54:44,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:44,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396514882] [2024-10-25 14:54:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396514882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:54:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094273278] [2024-10-25 14:54:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:44,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:54:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:54:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:54:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:44,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:44,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 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-10-25 14:54:44,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:44,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:44,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:54:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:54:50,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-25 14:54:50,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:50,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash 360439883, now seen corresponding path program 1 times [2024-10-25 14:54:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218479472] [2024-10-25 14:54:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:54:50,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:54:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:54:50,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:54:50,917 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:54:50,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:54:50,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:54:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-10-25 14:54:50,919 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:54:50,919 WARN L239 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:54:50,919 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-10-25 14:54:50,968 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-25 14:54:50,972 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:54:50,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:54:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:54:50,974 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:54:50,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-10-25 14:54:50,979 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:54:50,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:54:50,979 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:54:50,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:54:58,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:54:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:54:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1562720630, now seen corresponding path program 1 times [2024-10-25 14:54:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:54:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463196497] [2024-10-25 14:54:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:54:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:54:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:54:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-25 14:54:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:54:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463196497] [2024-10-25 14:54:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463196497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:54:58,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:54:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:54:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394233457] [2024-10-25 14:54:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:54:58,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:54:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:54:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:54:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:54:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:54:58,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:54:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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-10-25 14:54:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-10-25 14:55:17,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1903576960, now seen corresponding path program 1 times [2024-10-25 14:55:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280528591] [2024-10-25 14:55:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:55:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-25 14:55:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:55:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280528591] [2024-10-25 14:55:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280528591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:55:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:55:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:55:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404292] [2024-10-25 14:55:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:55:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:55:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:55:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:55:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:55:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:18,041 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:55:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-10-25 14:55:18,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:18,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:55:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-10-25 14:55:20,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2118557662, now seen corresponding path program 2 times [2024-10-25 14:55:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:20,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184950488] [2024-10-25 14:55:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:55:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-25 14:55:20,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:55:20,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184950488] [2024-10-25 14:55:20,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184950488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:55:20,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:55:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:55:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930419753] [2024-10-25 14:55:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:55:20,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:55:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:55:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:55:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:55:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:20,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:55:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 3 states have internal predecessors, (310), 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-10-25 14:55:20,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:20,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:55:20,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:55:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:55:27,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-10-25 14:55:27,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 750130098, now seen corresponding path program 1 times [2024-10-25 14:55:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630893555] [2024-10-25 14:55:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:55:27,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:55:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:55:27,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:55:27,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:55:27,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:55:27,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:55:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-10-25 14:55:27,780 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:55:27,780 WARN L239 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:55:27,780 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-10-25 14:55:27,832 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-10-25 14:55:27,836 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:55:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:55:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:55:27,838 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:55:27,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-25 14:55:27,847 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:55:27,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:55:27,848 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:55:27,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:55:36,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash 773850273, now seen corresponding path program 1 times [2024-10-25 14:55:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27006147] [2024-10-25 14:55:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:36,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:55:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-25 14:55:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:55:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27006147] [2024-10-25 14:55:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27006147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:55:36,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:55:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:55:36,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096912175] [2024-10-25 14:55:36,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:55:36,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:55:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:55:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:55:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:55:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:36,459 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:55:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 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-10-25 14:55:36,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-10-25 14:55:57,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 154463064, now seen corresponding path program 1 times [2024-10-25 14:55:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567034458] [2024-10-25 14:55:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:55:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-25 14:55:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:55:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567034458] [2024-10-25 14:55:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567034458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:55:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:55:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:55:57,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748660546] [2024-10-25 14:55:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:55:57,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:55:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:55:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:55:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:55:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:57,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:55:57,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-10-25 14:55:57,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:57,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:55:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:55:59,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-10-25 14:55:59,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:55:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:55:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 425146636, now seen corresponding path program 2 times [2024-10-25 14:55:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:55:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12300658] [2024-10-25 14:55:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:55:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:55:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:56:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2024-10-25 14:56:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:56:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12300658] [2024-10-25 14:56:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12300658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:56:00,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:56:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:56:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160810838] [2024-10-25 14:56:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:56:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:56:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:56:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:56:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:56:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:00,352 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:56:00,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 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-10-25 14:56:00,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:00,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:56:00,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:56:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:56:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-10-25 14:56:07,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:56:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:56:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1092860327, now seen corresponding path program 1 times [2024-10-25 14:56:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:56:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279637462] [2024-10-25 14:56:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:56:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:56:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:56:07,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:56:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:56:07,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:56:08,000 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:56:08,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:56:08,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:56:08,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-10-25 14:56:08,001 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:56:08,001 WARN L239 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:56:08,001 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-10-25 14:56:08,055 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-10-25 14:56:08,059 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:56:08,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:56:08,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:56:08,061 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:56:08,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-25 14:56:08,067 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:56:08,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:56:08,068 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:56:08,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:56:17,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:56:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:56:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 288698548, now seen corresponding path program 1 times [2024-10-25 14:56:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:56:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39994207] [2024-10-25 14:56:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:56:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:56:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:56:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-10-25 14:56:17,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:56:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39994207] [2024-10-25 14:56:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39994207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:56:17,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:56:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:56:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428938460] [2024-10-25 14:56:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:56:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:56:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:56:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:56:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:56:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:17,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:56:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 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-10-25 14:56:17,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-10-25 14:56:40,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:56:40,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:56:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1758155467, now seen corresponding path program 1 times [2024-10-25 14:56:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:56:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109747501] [2024-10-25 14:56:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:56:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:56:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:56:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-25 14:56:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:56:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109747501] [2024-10-25 14:56:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109747501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:56:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:56:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:56:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716775266] [2024-10-25 14:56:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:56:40,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:56:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:56:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:56:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:56:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:40,878 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:56:40,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-10-25 14:56:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:56:43,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-10-25 14:56:43,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:56:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:56:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 125596693, now seen corresponding path program 2 times [2024-10-25 14:56:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:56:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810037466] [2024-10-25 14:56:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:56:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:56:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:56:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-25 14:56:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:56:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810037466] [2024-10-25 14:56:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810037466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:56:43,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:56:43,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:56:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536107266] [2024-10-25 14:56:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:56:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:56:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:56:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:56:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:56:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:43,500 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:56:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 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-10-25 14:56:43,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:43,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:56:43,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:56:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:56:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:56:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-10-25 14:56:52,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:56:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:56:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1072678548, now seen corresponding path program 1 times [2024-10-25 14:56:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:56:52,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136620538] [2024-10-25 14:56:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:56:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:56:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:56:52,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:56:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:56:52,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:56:52,190 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:56:52,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:56:52,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:56:52,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-10-25 14:56:52,192 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:56:52,192 WARN L239 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:56:52,192 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-10-25 14:56:52,245 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-10-25 14:56:52,249 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:56:52,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:56:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:56:52,251 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:56:52,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-10-25 14:56:52,421 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:56:52,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:56:52,422 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:56:52,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:57:02,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:57:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:57:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash -806259558, now seen corresponding path program 1 times [2024-10-25 14:57:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:57:02,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686820664] [2024-10-25 14:57:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:57:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:57:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:57:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-25 14:57:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:57:02,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686820664] [2024-10-25 14:57:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686820664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:57:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:57:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:57:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268483552] [2024-10-25 14:57:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:57:02,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:57:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:57:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:57:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:57:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:02,766 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:57:02,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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-10-25 14:57:02,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-10-25 14:57:28,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:57:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:57:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1614554123, now seen corresponding path program 1 times [2024-10-25 14:57:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:57:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102016655] [2024-10-25 14:57:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:57:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:57:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:57:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-25 14:57:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:57:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102016655] [2024-10-25 14:57:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102016655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:57:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:57:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:57:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227284737] [2024-10-25 14:57:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:57:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:57:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:57:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:57:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:57:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:28,420 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:57:28,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-10-25 14:57:28,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:28,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:57:30,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-10-25 14:57:30,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:57:30,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:57:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903239, now seen corresponding path program 2 times [2024-10-25 14:57:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:57:30,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888303254] [2024-10-25 14:57:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:57:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:57:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:57:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-25 14:57:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:57:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888303254] [2024-10-25 14:57:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888303254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:57:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:57:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:57:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746495673] [2024-10-25 14:57:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:57:30,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:57:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:57:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:57:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:57:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:30,867 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:57:30,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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-10-25 14:57:30,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:30,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:57:30,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:57:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:57:40,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-10-25 14:57:40,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:57:40,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:57:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash -311573222, now seen corresponding path program 1 times [2024-10-25 14:57:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:57:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510186168] [2024-10-25 14:57:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:57:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:57:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:57:40,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:57:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:57:40,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:57:40,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:57:40,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:57:40,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:57:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-10-25 14:57:40,830 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:57:40,830 WARN L239 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:57:40,831 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-10-25 14:57:40,887 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-10-25 14:57:40,891 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:57:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:57:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:57:40,895 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:57:40,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-10-25 14:57:40,899 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:57:40,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:57:40,900 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:57:40,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:57:52,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:57:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:57:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1352969086, now seen corresponding path program 1 times [2024-10-25 14:57:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:57:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402255977] [2024-10-25 14:57:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:57:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:57:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:57:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-25 14:57:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:57:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402255977] [2024-10-25 14:57:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402255977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:57:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:57:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:57:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222844500] [2024-10-25 14:57:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:57:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:57:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:57:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:57:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:57:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:57:52,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:57:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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-10-25 14:57:52,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:19,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-10-25 14:58:19,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:58:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:58:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1397558707, now seen corresponding path program 1 times [2024-10-25 14:58:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:58:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460969192] [2024-10-25 14:58:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:58:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:58:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:58:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-25 14:58:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:58:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460969192] [2024-10-25 14:58:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460969192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:58:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:58:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:58:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766854029] [2024-10-25 14:58:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:58:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:58:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:58:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:58:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:58:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:20,041 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:58:20,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-10-25 14:58:20,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:20,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:58:22,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-10-25 14:58:22,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:58:22,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:58:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1894790983, now seen corresponding path program 2 times [2024-10-25 14:58:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:58:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050765455] [2024-10-25 14:58:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:58:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:58:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:58:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-10-25 14:58:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:58:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050765455] [2024-10-25 14:58:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050765455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:58:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:58:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:58:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290498954] [2024-10-25 14:58:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:58:22,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:58:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:58:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:58:22,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:58:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:22,765 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:58:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 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-10-25 14:58:22,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:22,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:58:22,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:58:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:58:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-10-25 14:58:33,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:58:33,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:58:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 605839038, now seen corresponding path program 1 times [2024-10-25 14:58:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:58:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792425083] [2024-10-25 14:58:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:58:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:58:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:58:33,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:58:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:58:33,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:58:33,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:58:33,168 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:58:33,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:58:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-10-25 14:58:33,170 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:58:33,170 WARN L239 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:58:33,170 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-10-25 14:58:33,233 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-10-25 14:58:33,237 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:58:33,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:58:33,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:58:33,239 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:58:33,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-10-25 14:58:33,244 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:58:33,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:58:33,245 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:58:33,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:58:45,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:58:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:58:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash -415041833, now seen corresponding path program 1 times [2024-10-25 14:58:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:58:45,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39753846] [2024-10-25 14:58:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:58:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:58:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:58:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-10-25 14:58:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:58:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39753846] [2024-10-25 14:58:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39753846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:58:45,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:58:45,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:58:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544683913] [2024-10-25 14:58:45,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:58:45,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:58:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:58:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:58:45,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:58:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:58:45,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:58:45,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 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-10-25 14:58:45,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:15,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-10-25 14:59:15,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:59:15,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:59:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1682510176, now seen corresponding path program 1 times [2024-10-25 14:59:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:59:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227376528] [2024-10-25 14:59:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:59:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:59:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:59:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2024-10-25 14:59:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:59:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227376528] [2024-10-25 14:59:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227376528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:59:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:59:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:59:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654687200] [2024-10-25 14:59:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:59:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 14:59:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:59:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 14:59:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 14:59:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:15,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:59:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-10-25 14:59:15,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:15,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:59:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-10-25 14:59:18,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:59:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:59:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1621458090, now seen corresponding path program 2 times [2024-10-25 14:59:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:59:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837761274] [2024-10-25 14:59:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:59:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:59:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:59:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-10-25 14:59:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:59:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837761274] [2024-10-25 14:59:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837761274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:59:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:59:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 14:59:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124491325] [2024-10-25 14:59:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:59:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 14:59:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:59:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 14:59:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 14:59:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:18,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:59:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 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-10-25 14:59:18,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:18,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:59:18,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 14:59:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 14:59:30,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-10-25 14:59:30,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:59:30,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:59:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1086039968, now seen corresponding path program 1 times [2024-10-25 14:59:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:59:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991898171] [2024-10-25 14:59:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:59:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:59:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:59:30,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 14:59:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 14:59:30,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 14:59:30,303 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 14:59:30,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 14:59:30,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 14:59:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-10-25 14:59:30,305 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 14:59:30,305 WARN L239 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 14:59:30,305 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-10-25 14:59:30,369 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-10-25 14:59:30,373 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:59:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 14:59:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 14:59:30,376 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 14:59:30,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-10-25 14:59:30,380 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 14:59:30,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 14:59:30,382 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 14:59:30,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 14:59:43,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 14:59:43,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 14:59:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 511145272, now seen corresponding path program 1 times [2024-10-25 14:59:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 14:59:43,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107433416] [2024-10-25 14:59:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 14:59:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 14:59:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 14:59:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-25 14:59:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 14:59:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107433416] [2024-10-25 14:59:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107433416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 14:59:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 14:59:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 14:59:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411618760] [2024-10-25 14:59:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 14:59:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 14:59:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 14:59:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 14:59:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 14:59:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 14:59:43,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 14:59:43,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 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-10-25 14:59:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-10-25 15:00:16,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:00:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:00:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 788182278, now seen corresponding path program 1 times [2024-10-25 15:00:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:00:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122500728] [2024-10-25 15:00:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:00:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:00:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:00:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-10-25 15:00:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:00:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122500728] [2024-10-25 15:00:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122500728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:00:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:00:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:00:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133048475] [2024-10-25 15:00:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:00:16,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:00:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:00:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:00:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:00:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:16,278 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:00:16,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-10-25 15:00:16,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:16,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:00:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-10-25 15:00:18,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:00:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:00:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1364119944, now seen corresponding path program 2 times [2024-10-25 15:00:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:00:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798594267] [2024-10-25 15:00:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:00:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:00:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:00:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-25 15:00:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:00:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798594267] [2024-10-25 15:00:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798594267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:00:19,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:00:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:00:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505033255] [2024-10-25 15:00:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:00:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 15:00:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:00:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 15:00:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 15:00:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:19,048 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:00:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 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-10-25 15:00:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:00:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:00:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:00:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-10-25 15:00:31,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:00:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:00:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1471853019, now seen corresponding path program 1 times [2024-10-25 15:00:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:00:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582785314] [2024-10-25 15:00:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:00:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:00:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:00:32,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:00:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:00:32,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:00:32,112 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:00:32,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:00:32,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:00:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-10-25 15:00:32,113 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:00:32,114 WARN L239 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:00:32,114 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-10-25 15:00:32,172 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-10-25 15:00:32,177 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:00:32,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:00:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:00:32,180 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:00:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-10-25 15:00:32,184 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:00:32,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:00:32,184 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:00:32,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:00:46,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:00:46,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:00:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1851640008, now seen corresponding path program 1 times [2024-10-25 15:00:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:00:46,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712076877] [2024-10-25 15:00:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:00:46,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:00:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:00:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-10-25 15:00:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:00:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712076877] [2024-10-25 15:00:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712076877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:00:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:00:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:00:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348595419] [2024-10-25 15:00:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:00:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:00:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:00:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:00:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:00:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:00:46,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:00:46,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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-10-25 15:00:46,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-10-25 15:01:21,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:01:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:01:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -332290088, now seen corresponding path program 1 times [2024-10-25 15:01:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:01:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847812321] [2024-10-25 15:01:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:01:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:01:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:01:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2024-10-25 15:01:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:01:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847812321] [2024-10-25 15:01:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847812321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:01:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:01:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:01:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834462745] [2024-10-25 15:01:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:01:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:01:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:01:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:01:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:01:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:21,764 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:01:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-10-25 15:01:21,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:21,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:01:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-10-25 15:01:23,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:01:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:01:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1892244586, now seen corresponding path program 2 times [2024-10-25 15:01:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:01:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732554551] [2024-10-25 15:01:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:01:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:01:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:01:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2024-10-25 15:01:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:01:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732554551] [2024-10-25 15:01:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732554551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:01:24,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:01:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:01:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238587479] [2024-10-25 15:01:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:01:24,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 15:01:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:01:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 15:01:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 15:01:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:24,646 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:01:24,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 3 states have internal predecessors, (436), 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-10-25 15:01:24,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:24,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:01:24,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:01:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:01:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-10-25 15:01:38,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:01:38,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:01:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1582928981, now seen corresponding path program 1 times [2024-10-25 15:01:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:01:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358276496] [2024-10-25 15:01:38,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:01:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:01:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:01:38,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:01:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:01:38,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:01:38,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:01:38,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:01:38,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:01:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-10-25 15:01:38,376 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:01:38,377 WARN L239 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:01:38,377 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-10-25 15:01:38,439 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-10-25 15:01:38,444 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:01:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:01:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:01:38,448 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:01:38,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2024-10-25 15:01:38,453 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:01:38,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:01:38,453 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:01:38,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:01:53,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:01:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:01:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1351325510, now seen corresponding path program 1 times [2024-10-25 15:01:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:01:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773768537] [2024-10-25 15:01:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:01:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:01:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:01:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-25 15:01:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:01:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773768537] [2024-10-25 15:01:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773768537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:01:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:01:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:01:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143833659] [2024-10-25 15:01:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:01:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:01:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:01:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:01:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:01:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:01:54,049 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:01:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 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-10-25 15:01:54,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-10-25 15:02:31,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:02:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:02:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 686116577, now seen corresponding path program 1 times [2024-10-25 15:02:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:02:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720715421] [2024-10-25 15:02:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:02:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:02:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:02:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2024-10-25 15:02:31,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:02:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720715421] [2024-10-25 15:02:31,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720715421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:02:31,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:02:31,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:02:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999443071] [2024-10-25 15:02:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:02:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:02:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:02:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:02:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:02:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:31,963 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:02:31,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-10-25 15:02:31,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:31,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:02:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-10-25 15:02:34,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:02:34,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:02:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1842280493, now seen corresponding path program 2 times [2024-10-25 15:02:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:02:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415584487] [2024-10-25 15:02:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:02:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:02:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:02:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2024-10-25 15:02:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:02:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415584487] [2024-10-25 15:02:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415584487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:02:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:02:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:02:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072193761] [2024-10-25 15:02:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:02:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-25 15:02:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:02:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 15:02:34,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 15:02:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:34,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:02:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 3 states have internal predecessors, (454), 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-10-25 15:02:34,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:34,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:02:34,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:02:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:02:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:02:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-10-25 15:02:49,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:02:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:02:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -197160423, now seen corresponding path program 1 times [2024-10-25 15:02:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:02:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47537973] [2024-10-25 15:02:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:02:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:02:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:02:49,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:02:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:02:49,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:02:49,749 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:02:49,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:02:49,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:02:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-10-25 15:02:49,750 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:02:49,750 WARN L239 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:02:49,750 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-10-25 15:02:49,805 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-10-25 15:02:49,809 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:02:49,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:02:49,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:02:49,814 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:02:49,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2024-10-25 15:02:49,818 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:02:49,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:02:49,819 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;@7a286fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:02:49,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:03:06,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:03:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:03:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -577240063, now seen corresponding path program 1 times [2024-10-25 15:03:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:03:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942062002] [2024-10-25 15:03:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:03:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:03:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:03:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-25 15:03:06,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:03:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942062002] [2024-10-25 15:03:06,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942062002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:03:06,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:03:06,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:03:06,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096191022] [2024-10-25 15:03:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:03:06,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:03:06,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:03:06,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:03:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:03:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:03:06,488 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:03:06,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-10-25 15:03:06,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15