./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.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_36-indirect_racefree.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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-25 15:19:33,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 15:19:33,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-25 15:19:33,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 15:19:33,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 15:19:33,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 15:19:33,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 15:19:33,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 15:19:33,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-25 15:19:33,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-25 15:19:33,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 15:19:33,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 15:19:33,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 15:19:33,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 15:19:33,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-25 15:19:33,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 15:19:33,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 15:19:33,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 15:19:33,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 15:19:33,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-25 15:19:33,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-25 15:19:33,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-25 15:19:33,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 15:19:33,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 15:19:33,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 15:19:33,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 15:19:33,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:19:33,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-25 15:19:33,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-25 15:19:33,201 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-25 15:19:33,202 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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2024-10-25 15:19:33,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 15:19:33,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 15:19:33,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 15:19:33,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 15:19:33,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 15:19:33,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-10-25 15:19:34,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 15:19:34,858 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 15:19:34,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-10-25 15:19:34,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/641c552c7/1a83c1ad3868455c9820e158b8c01357/FLAGd80041cb4 [2024-10-25 15:19:34,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/641c552c7/1a83c1ad3868455c9820e158b8c01357 [2024-10-25 15:19:34,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 15:19:34,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 15:19:34,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 15:19:34,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 15:19:34,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 15:19:34,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:34" (1/1) ... [2024-10-25 15:19:34,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2d61fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:34, skipping insertion in model container [2024-10-25 15:19:34,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:34" (1/1) ... [2024-10-25 15:19:34,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 15:19:35,160 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_36-indirect_racefree.i[30176,30189] [2024-10-25 15:19:35,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:19:35,195 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 15:19:35,231 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_36-indirect_racefree.i[30176,30189] [2024-10-25 15:19:35,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:19:35,271 INFO L204 MainTranslator]: Completed translation [2024-10-25 15:19:35,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35 WrapperNode [2024-10-25 15:19:35,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 15:19:35,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 15:19:35,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 15:19:35,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 15:19:35,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,302 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-25 15:19:35,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 15:19:35,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 15:19:35,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 15:19:35,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 15:19:35,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 15:19:35,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 15:19:35,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 15:19:35,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 15:19:35,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (1/1) ... [2024-10-25 15:19:35,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:19:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:35,370 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 15:19:35,372 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 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-25 15:19:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 15:19:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-25 15:19:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-25 15:19:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 15:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 15:19:35,405 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 15:19:35,493 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 15:19:35,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 15:19:35,680 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-25 15:19:35,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 15:19:35,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 15:19:35,822 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-25 15:19:35,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:35 BoogieIcfgContainer [2024-10-25 15:19:35,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 15:19:35,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-25 15:19:35,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-25 15:19:35,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-25 15:19:35,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:19:34" (1/3) ... [2024-10-25 15:19:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c6f53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:35, skipping insertion in model container [2024-10-25 15:19:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35" (2/3) ... [2024-10-25 15:19:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c6f53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:35, skipping insertion in model container [2024-10-25 15:19:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:35" (3/3) ... [2024-10-25 15:19:35,832 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-10-25 15:19:35,864 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-25 15:19:35,864 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-25 15:19:35,866 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-25 15:19:35,888 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-25 15:19:35,921 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:35,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:35,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:35,923 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 15:19:35,924 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 15:19:35,949 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:35,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:35,962 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:35,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:36,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -399240687, now seen corresponding path program 1 times [2024-10-25 15:19:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948580559] [2024-10-25 15:19:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:36,370 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 15:19:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948580559] [2024-10-25 15:19:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948580559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:36,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:36,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532131304] [2024-10-25 15:19:36,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:36,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:36,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:36,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:36,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:36,400 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 15:19:36,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-25 15:19:36,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -585889617, now seen corresponding path program 1 times [2024-10-25 15:19:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215257454] [2024-10-25 15:19:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:36,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:36,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:36,614 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:36,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:36,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:36,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-25 15:19:36,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-25 15:19:36,628 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:36,628 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-25 15:19:36,652 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-25 15:19:36,655 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:36,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:36,677 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 15:19:36,679 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 15:19:36,681 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:36,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:36,682 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:36,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:37,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:37,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1538466082, now seen corresponding path program 1 times [2024-10-25 15:19:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853534428] [2024-10-25 15:19:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:37,138 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 15:19:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853534428] [2024-10-25 15:19:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853534428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372617579] [2024-10-25 15:19:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:37,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,141 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:37,141 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 15:19:37,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-25 15:19:37,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1514576791, now seen corresponding path program 1 times [2024-10-25 15:19:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996402325] [2024-10-25 15:19:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:37,736 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 15:19:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996402325] [2024-10-25 15:19:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996402325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841487954] [2024-10-25 15:19:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:37,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:37,740 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 15:19:37,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:37,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-25 15:19:37,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1427983920, now seen corresponding path program 1 times [2024-10-25 15:19:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625595683] [2024-10-25 15:19:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:38,026 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 15:19:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625595683] [2024-10-25 15:19:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625595683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:38,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140850488] [2024-10-25 15:19:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:38,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:38,031 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:38,031 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 15:19:38,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:38,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:38,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-25 15:19:38,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 381372271, now seen corresponding path program 1 times [2024-10-25 15:19:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286753944] [2024-10-25 15:19:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:38,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:38,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:38,154 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:38,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:38,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-25 15:19:38,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:38,158 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:38,158 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-25 15:19:38,172 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-25 15:19:38,175 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:38,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:38,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:38,178 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 15:19:38,179 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 15:19:38,181 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:38,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:38,182 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:38,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:38,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash -834866150, now seen corresponding path program 1 times [2024-10-25 15:19:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44463915] [2024-10-25 15:19:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:38,680 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 15:19:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44463915] [2024-10-25 15:19:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44463915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287533299] [2024-10-25 15:19:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:38,684 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:38,684 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 15:19:38,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-25 15:19:39,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:39,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash 792220000, now seen corresponding path program 1 times [2024-10-25 15:19:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:39,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874168317] [2024-10-25 15:19:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:39,750 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 15:19:39,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874168317] [2024-10-25 15:19:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874168317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418032495] [2024-10-25 15:19:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,752 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:39,752 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 15:19:39,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:39,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-25 15:19:39,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1610595786, now seen corresponding path program 1 times [2024-10-25 15:19:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:39,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879616363] [2024-10-25 15:19:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:40,097 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 15:19:40,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879616363] [2024-10-25 15:19:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879616363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:40,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91937024] [2024-10-25 15:19:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:40,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 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 15:19:40,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:40,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:40,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:40,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-25 15:19:40,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:40,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1335619126, now seen corresponding path program 1 times [2024-10-25 15:19:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128770667] [2024-10-25 15:19:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:40,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:40,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:40,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:40,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:40,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-25 15:19:40,328 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:40,329 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:40,329 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-25 15:19:40,346 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-25 15:19:40,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:40,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:40,351 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 15:19:40,353 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 15:19:40,354 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:40,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:40,355 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:40,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:40,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -529808252, now seen corresponding path program 1 times [2024-10-25 15:19:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611685007] [2024-10-25 15:19:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:40,994 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 15:19:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611685007] [2024-10-25 15:19:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611685007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713810822] [2024-10-25 15:19:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:40,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:40,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:40,996 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 15:19:40,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-25 15:19:42,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1542100202, now seen corresponding path program 1 times [2024-10-25 15:19:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436548337] [2024-10-25 15:19:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:42,520 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 15:19:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436548337] [2024-10-25 15:19:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436548337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506342896] [2024-10-25 15:19:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:42,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,522 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:42,522 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 15:19:42,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:42,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-25 15:19:42,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1941357691, now seen corresponding path program 1 times [2024-10-25 15:19:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799102175] [2024-10-25 15:19:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:42,892 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 15:19:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799102175] [2024-10-25 15:19:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799102175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718841666] [2024-10-25 15:19:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:42,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,894 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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 15:19:42,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:42,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:42,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-25 15:19:43,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -151281373, now seen corresponding path program 1 times [2024-10-25 15:19:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140575141] [2024-10-25 15:19:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:43,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:43,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:43,154 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:43,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:43,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:43,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-25 15:19:43,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:43,156 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:43,156 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-25 15:19:43,172 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-25 15:19:43,176 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:43,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:43,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:43,178 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 15:19:43,179 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 15:19:43,181 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:43,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:43,181 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:43,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:43,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2017418155, now seen corresponding path program 1 times [2024-10-25 15:19:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709386333] [2024-10-25 15:19:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:44,020 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 15:19:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709386333] [2024-10-25 15:19:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709386333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701876742] [2024-10-25 15:19:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:44,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:44,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:44,022 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 15:19:44,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-25 15:19:46,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:46,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 301686019, now seen corresponding path program 1 times [2024-10-25 15:19:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459095215] [2024-10-25 15:19:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:46,150 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 15:19:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459095215] [2024-10-25 15:19:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459095215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132908721] [2024-10-25 15:19:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,152 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:46,152 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 15:19:46,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:46,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-25 15:19:46,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:46,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1202288057, now seen corresponding path program 1 times [2024-10-25 15:19:46,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259937134] [2024-10-25 15:19:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:46,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:46,695 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 15:19:46,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259937134] [2024-10-25 15:19:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259937134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664737760] [2024-10-25 15:19:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,698 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:46,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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 15:19:46,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:46,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:46,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:47,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-25 15:19:47,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -861328764, now seen corresponding path program 1 times [2024-10-25 15:19:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:47,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61377535] [2024-10-25 15:19:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:47,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:47,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:47,115 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:47,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:47,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:47,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-25 15:19:47,117 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:47,117 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:47,117 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-25 15:19:47,135 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-25 15:19:47,136 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:47,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:47,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:47,138 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 15:19:47,139 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 15:19:47,141 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:47,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:47,141 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:47,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:48,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 492150306, now seen corresponding path program 1 times [2024-10-25 15:19:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108110721] [2024-10-25 15:19:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:48,183 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 15:19:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108110721] [2024-10-25 15:19:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108110721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696685031] [2024-10-25 15:19:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:48,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:48,184 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 15:19:48,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-25 15:19:50,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1748181276, now seen corresponding path program 1 times [2024-10-25 15:19:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694116904] [2024-10-25 15:19:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:50,986 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 15:19:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694116904] [2024-10-25 15:19:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694116904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310349944] [2024-10-25 15:19:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:50,988 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:50,988 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 15:19:50,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:50,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-25 15:19:51,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -780546081, now seen corresponding path program 1 times [2024-10-25 15:19:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140916164] [2024-10-25 15:19:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:51,604 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 15:19:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140916164] [2024-10-25 15:19:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140916164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:51,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981585681] [2024-10-25 15:19:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:51,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:51,606 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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 15:19:51,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:51,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:51,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-25 15:19:52,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1687839950, now seen corresponding path program 1 times [2024-10-25 15:19:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988845960] [2024-10-25 15:19:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:52,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:52,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:52,180 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:52,180 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:52,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-25 15:19:52,181 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:52,181 WARN L239 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:52,181 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-10-25 15:19:52,199 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-10-25 15:19:52,200 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:52,202 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 15:19:52,203 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 15:19:52,205 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:52,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:52,205 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:52,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:19:53,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:53,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash 737687192, now seen corresponding path program 1 times [2024-10-25 15:19:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:53,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366335589] [2024-10-25 15:19:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:53,568 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 15:19:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366335589] [2024-10-25 15:19:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366335589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:19:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210657376] [2024-10-25 15:19:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:19:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:19:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:19:53,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:53,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:53,569 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 15:19:53,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-25 15:19:57,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:57,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1583971766, now seen corresponding path program 1 times [2024-10-25 15:19:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645316231] [2024-10-25 15:19:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:57,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:57,100 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 15:19:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645316231] [2024-10-25 15:19:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645316231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:57,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:19:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137754051] [2024-10-25 15:19:57,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:57,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:19:57,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:57,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:19:57,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:19:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,103 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:57,103 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 15:19:57,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-25 15:19:57,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -953764918, now seen corresponding path program 1 times [2024-10-25 15:19:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865838300] [2024-10-25 15:19:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:19:57,957 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 15:19:57,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:19:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865838300] [2024-10-25 15:19:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865838300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:19:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:19:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:19:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662201524] [2024-10-25 15:19:57,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:19:57,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:19:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:19:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:19:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:19:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,959 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:19:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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 15:19:57,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:57,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:57,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:19:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:19:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:19:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-25 15:19:58,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:19:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:19:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1056675599, now seen corresponding path program 1 times [2024-10-25 15:19:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:19:58,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667097548] [2024-10-25 15:19:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:19:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:19:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:58,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:19:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:19:58,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:19:58,663 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:19:58,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:19:58,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:19:58,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-25 15:19:58,664 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:19:58,664 WARN L239 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:19:58,664 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-10-25 15:19:58,685 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-10-25 15:19:58,686 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:58,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:19:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:19:58,689 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 15:19:58,689 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 15:19:58,691 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:19:58,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:19:58,692 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:19:58,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:00,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1614658048, now seen corresponding path program 1 times [2024-10-25 15:20:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130759817] [2024-10-25 15:20:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:00,263 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 15:20:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130759817] [2024-10-25 15:20:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130759817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734276292] [2024-10-25 15:20:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:00,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:00,265 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:00,265 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 15:20:00,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-25 15:20:04,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 462477972, now seen corresponding path program 1 times [2024-10-25 15:20:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794286867] [2024-10-25 15:20:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:04,639 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 15:20:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794286867] [2024-10-25 15:20:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794286867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:20:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618359029] [2024-10-25 15:20:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:04,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:20:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:20:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:20:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:04,641 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:04,641 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 15:20:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:05,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-25 15:20:05,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:05,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1809741834, now seen corresponding path program 1 times [2024-10-25 15:20:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094595980] [2024-10-25 15:20:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:05,575 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 15:20:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094595980] [2024-10-25 15:20:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094595980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:20:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726622516] [2024-10-25 15:20:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:20:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:20:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:20:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:05,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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 15:20:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:20:06,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-25 15:20:06,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:06,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -332855932, now seen corresponding path program 1 times [2024-10-25 15:20:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183415037] [2024-10-25 15:20:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:06,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:20:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:06,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:20:06,448 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:20:06,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:20:06,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:20:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-25 15:20:06,449 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:20:06,449 WARN L239 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:20:06,449 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-10-25 15:20:06,469 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-10-25 15:20:06,471 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:06,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:20:06,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:20:06,472 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 15:20:06,473 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 15:20:06,475 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:20:06,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:20:06,475 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:06,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:08,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:20:08,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -471132559, now seen corresponding path program 1 times [2024-10-25 15:20:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244954812] [2024-10-25 15:20:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:08,455 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 15:20:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:08,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244954812] [2024-10-25 15:20:08,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244954812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:08,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665416489] [2024-10-25 15:20:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:08,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:08,456 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:08,457 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 15:20:08,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:13,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-25 15:20:13,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:13,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 884891849, now seen corresponding path program 1 times [2024-10-25 15:20:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124486721] [2024-10-25 15:20:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:13,561 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 15:20:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124486721] [2024-10-25 15:20:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124486721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:20:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407997999] [2024-10-25 15:20:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:20:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:20:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:20:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:13,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:13,562 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 15:20:13,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:13,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-25 15:20:14,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:14,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1853796957, now seen corresponding path program 1 times [2024-10-25 15:20:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582214963] [2024-10-25 15:20:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:14,572 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 15:20:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582214963] [2024-10-25 15:20:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582214963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:14,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:14,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:20:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456082154] [2024-10-25 15:20:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:14,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:20:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:20:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:20:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:14,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:14,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 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 15:20:14,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:14,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:14,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:20:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-25 15:20:15,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1981738499, now seen corresponding path program 1 times [2024-10-25 15:20:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894972968] [2024-10-25 15:20:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:15,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:20:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:15,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:20:15,714 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:20:15,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:20:15,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:20:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-25 15:20:15,715 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:20:15,715 WARN L239 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:20:15,715 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-10-25 15:20:15,736 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-10-25 15:20:15,738 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:20:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:20:15,740 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 15:20:15,741 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 15:20:15,742 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:20:15,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:20:15,743 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:15,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:18,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -327520114, now seen corresponding path program 1 times [2024-10-25 15:20:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572402542] [2024-10-25 15:20:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:18,060 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 15:20:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572402542] [2024-10-25 15:20:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572402542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991856208] [2024-10-25 15:20:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:18,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:18,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:18,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:18,062 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 15:20:18,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-25 15:20:23,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -225716842, now seen corresponding path program 1 times [2024-10-25 15:20:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880093786] [2024-10-25 15:20:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:23,957 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 15:20:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880093786] [2024-10-25 15:20:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880093786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:20:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391897031] [2024-10-25 15:20:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:20:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:20:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:20:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:23,959 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:23,959 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 15:20:23,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:23,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-25 15:20:24,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:24,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -86912805, now seen corresponding path program 1 times [2024-10-25 15:20:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025290435] [2024-10-25 15:20:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:25,112 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 15:20:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025290435] [2024-10-25 15:20:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025290435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:20:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700820121] [2024-10-25 15:20:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:20:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:20:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:20:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:25,114 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 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 15:20:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:20:26,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-25 15:20:26,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1849716232, now seen corresponding path program 1 times [2024-10-25 15:20:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649261266] [2024-10-25 15:20:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:26,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:20:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:26,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:20:26,408 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:20:26,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:20:26,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:20:26,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-25 15:20:26,410 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:20:26,410 WARN L239 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:20:26,411 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-10-25 15:20:26,434 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-10-25 15:20:26,436 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:20:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:20:26,438 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 15:20:26,439 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 15:20:26,441 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:20:26,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:20:26,441 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:26,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:29,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash 153118982, now seen corresponding path program 1 times [2024-10-25 15:20:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466774357] [2024-10-25 15:20:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:29,209 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 15:20:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466774357] [2024-10-25 15:20:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466774357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856846728] [2024-10-25 15:20:29,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:29,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:29,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:29,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:29,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:29,211 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:29,211 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 15:20:29,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:35,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-25 15:20:35,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1004005877, now seen corresponding path program 1 times [2024-10-25 15:20:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303608645] [2024-10-25 15:20:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:36,036 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 15:20:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:36,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303608645] [2024-10-25 15:20:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303608645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:20:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577888956] [2024-10-25 15:20:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:20:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:20:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:20:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:36,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:36,038 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 15:20:36,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:36,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:37,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-25 15:20:37,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:37,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1394543591, now seen corresponding path program 1 times [2024-10-25 15:20:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538846760] [2024-10-25 15:20:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:37,260 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 15:20:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538846760] [2024-10-25 15:20:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538846760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:20:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595492932] [2024-10-25 15:20:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:37,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:20:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:20:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:20:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:37,262 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:37,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 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 15:20:37,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:37,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:37,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:20:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-25 15:20:39,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1691208483, now seen corresponding path program 1 times [2024-10-25 15:20:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685250980] [2024-10-25 15:20:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:39,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:20:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:39,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:20:39,121 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:20:39,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:20:39,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:20:39,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-25 15:20:39,122 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:20:39,123 WARN L239 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:20:39,123 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-10-25 15:20:39,152 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-10-25 15:20:39,155 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:20:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:20:39,157 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 15:20:39,158 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 15:20:39,160 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:20:39,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:20:39,161 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:39,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:42,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1941851404, now seen corresponding path program 1 times [2024-10-25 15:20:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505211450] [2024-10-25 15:20:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:42,279 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 15:20:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:42,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505211450] [2024-10-25 15:20:42,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505211450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:42,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:42,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158912026] [2024-10-25 15:20:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:42,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:42,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:42,281 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 15:20:42,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:49,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-25 15:20:49,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:49,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1719403684, now seen corresponding path program 1 times [2024-10-25 15:20:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172386755] [2024-10-25 15:20:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:50,056 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 15:20:50,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172386755] [2024-10-25 15:20:50,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172386755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:50,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:20:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035565852] [2024-10-25 15:20:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:20:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:20:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:20:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:50,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:50,058 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 15:20:50,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:50,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-25 15:20:51,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 469167312, now seen corresponding path program 1 times [2024-10-25 15:20:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037103066] [2024-10-25 15:20:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:51,650 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 15:20:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037103066] [2024-10-25 15:20:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037103066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:51,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:20:51,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437507642] [2024-10-25 15:20:51,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:51,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:20:51,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:20:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:20:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:51,652 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:51,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 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:20:51,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:51,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:51,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:20:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:20:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-25 15:20:53,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1003369615, now seen corresponding path program 1 times [2024-10-25 15:20:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030221072] [2024-10-25 15:20:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:53,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:20:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:20:53,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:20:53,898 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:20:53,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:20:53,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:20:53,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-25 15:20:53,899 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:20:53,900 WARN L239 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:20:53,900 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-10-25 15:20:53,930 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-10-25 15:20:53,932 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:20:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:20:53,934 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 15:20:53,935 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 15:20:53,937 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:20:53,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:20:53,937 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:20:53,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:20:57,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:20:57,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:20:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash 730851083, now seen corresponding path program 1 times [2024-10-25 15:20:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:20:57,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798650592] [2024-10-25 15:20:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:20:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:20:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:20:57,488 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 15:20:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:20:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798650592] [2024-10-25 15:20:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798650592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:20:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:20:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:20:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187097816] [2024-10-25 15:20:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:20:57,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:20:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:20:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:20:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:20:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:20:57,489 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:20:57,490 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 15:20:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:06,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:06,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-25 15:21:06,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:21:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -960889614, now seen corresponding path program 1 times [2024-10-25 15:21:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404480050] [2024-10-25 15:21:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:06,643 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 15:21:06,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404480050] [2024-10-25 15:21:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404480050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:21:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350425298] [2024-10-25 15:21:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:06,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:21:06,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:21:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:21:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:06,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:06,644 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 15:21:06,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:06,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-25 15:21:08,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 504589299, now seen corresponding path program 1 times [2024-10-25 15:21:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61813320] [2024-10-25 15:21:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:08,408 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 15:21:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61813320] [2024-10-25 15:21:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61813320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:08,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:21:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128195974] [2024-10-25 15:21:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:21:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:21:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:21:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:08,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:08,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 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 15:21:08,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:08,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:08,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:21:10,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-25 15:21:10,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 127187030, now seen corresponding path program 1 times [2024-10-25 15:21:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292245759] [2024-10-25 15:21:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:10,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:21:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:10,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:21:10,833 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:21:10,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:21:10,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:21:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-25 15:21:10,835 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:21:10,835 WARN L239 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:21:10,835 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-10-25 15:21:10,864 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-10-25 15:21:10,866 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:21:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:21:10,867 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 15:21:10,869 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 15:21:10,871 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:21:10,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:21:10,872 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:10,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:21:14,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:14,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 520499530, now seen corresponding path program 1 times [2024-10-25 15:21:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055990052] [2024-10-25 15:21:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:14,937 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 15:21:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055990052] [2024-10-25 15:21:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055990052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:21:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821923918] [2024-10-25 15:21:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:21:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:21:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:21:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:14,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:14,938 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 15:21:14,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:25,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-25 15:21:25,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 535267654, now seen corresponding path program 1 times [2024-10-25 15:21:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308954450] [2024-10-25 15:21:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:25,582 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 15:21:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:25,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308954450] [2024-10-25 15:21:25,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308954450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:25,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:25,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:21:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573010713] [2024-10-25 15:21:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:25,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:21:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:21:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:21:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:25,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:25,583 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 15:21:25,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:25,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-25 15:21:27,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2054692386, now seen corresponding path program 1 times [2024-10-25 15:21:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528182659] [2024-10-25 15:21:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:27,647 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 15:21:27,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528182659] [2024-10-25 15:21:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528182659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:27,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:27,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:21:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419362805] [2024-10-25 15:21:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:27,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:21:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:21:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:21:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:27,650 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 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 15:21:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:21:30,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-25 15:21:30,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -471955201, now seen corresponding path program 1 times [2024-10-25 15:21:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473713927] [2024-10-25 15:21:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:30,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:21:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:30,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:21:30,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:21:30,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:21:30,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:21:30,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-25 15:21:30,878 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-25 15:21:30,878 WARN L239 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:21:30,878 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-10-25 15:21:30,915 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-10-25 15:21:30,918 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:30,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:21:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:21:30,919 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 15:21:30,920 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 15:21:30,923 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:21:30,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:21:30,924 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:30,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:21:35,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1203337420, now seen corresponding path program 1 times [2024-10-25 15:21:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128841024] [2024-10-25 15:21:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:35,564 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 15:21:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128841024] [2024-10-25 15:21:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128841024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:35,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:35,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:21:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204010286] [2024-10-25 15:21:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:35,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:21:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:21:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:21:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:35,566 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:35,566 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 15:21:35,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:47,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-25 15:21:47,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1336228276, now seen corresponding path program 1 times [2024-10-25 15:21:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660886714] [2024-10-25 15:21:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:47,575 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 15:21:47,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:47,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660886714] [2024-10-25 15:21:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660886714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:47,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:21:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447961820] [2024-10-25 15:21:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:47,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:21:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:47,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:21:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:21:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:47,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:47,576 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 15:21:47,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:47,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-25 15:21:49,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:49,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1603569568, now seen corresponding path program 2 times [2024-10-25 15:21:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:49,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776445622] [2024-10-25 15:21:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:49,445 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 15:21:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776445622] [2024-10-25 15:21:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776445622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:21:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491167837] [2024-10-25 15:21:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:49,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:21:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:21:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:21:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:49,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 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 15:21:49,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:49,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:49,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:21:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:21:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-25 15:21:53,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1343495256, now seen corresponding path program 1 times [2024-10-25 15:21:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249046551] [2024-10-25 15:21:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:53,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:21:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:21:53,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:21:53,329 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:21:53,329 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:21:53,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:21:53,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-25 15:21:53,330 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:21:53,330 WARN L239 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:21:53,330 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-10-25 15:21:53,363 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-10-25 15:21:53,365 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:53,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:21:53,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:21:53,367 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 15:21:53,367 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 15:21:53,370 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:21:53,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:21:53,371 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:21:53,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:21:58,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:21:58,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:21:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash -825510384, now seen corresponding path program 1 times [2024-10-25 15:21:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:21:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019938153] [2024-10-25 15:21:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:21:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:21:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:21:58,541 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 15:21:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:21:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019938153] [2024-10-25 15:21:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019938153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:21:58,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:21:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:21:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229589706] [2024-10-25 15:21:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:21:58,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:21:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:21:58,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:21:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:21:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:21:58,543 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:21:58,543 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 15:21:58,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:11,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-25 15:22:11,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:11,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1075727881, now seen corresponding path program 1 times [2024-10-25 15:22:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546168921] [2024-10-25 15:22:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:11,971 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 15:22:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546168921] [2024-10-25 15:22:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546168921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:11,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:11,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:22:11,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245547949] [2024-10-25 15:22:11,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:11,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:22:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:22:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:22:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:11,973 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:11,973 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 15:22:11,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:11,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:13,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-25 15:22:13,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:13,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1486124037, now seen corresponding path program 2 times [2024-10-25 15:22:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699676448] [2024-10-25 15:22:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:14,092 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 15:22:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699676448] [2024-10-25 15:22:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699676448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:22:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275193261] [2024-10-25 15:22:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:14,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:22:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:14,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:22:14,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:22:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:14,094 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 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 15:22:14,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:14,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:14,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:22:18,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-25 15:22:18,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:18,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1151504268, now seen corresponding path program 1 times [2024-10-25 15:22:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:18,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118048297] [2024-10-25 15:22:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:18,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:22:18,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:22:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:22:18,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:22:18,384 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:22:18,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:22:18,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:22:18,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-25 15:22:18,385 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:22:18,385 WARN L239 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:22:18,385 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-10-25 15:22:18,421 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-10-25 15:22:18,424 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:22:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:22:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:22:18,426 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 15:22:18,427 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 15:22:18,431 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:22:18,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:22:18,431 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:22:18,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:22:24,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:24,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1892942899, now seen corresponding path program 1 times [2024-10-25 15:22:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695578704] [2024-10-25 15:22:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:24,283 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 15:22:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695578704] [2024-10-25 15:22:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695578704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:24,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:22:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698520369] [2024-10-25 15:22:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:22:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:22:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:22:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:24,284 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:24,284 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 15:22:24,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:39,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-25 15:22:39,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1694398835, now seen corresponding path program 1 times [2024-10-25 15:22:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928742274] [2024-10-25 15:22:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:39,177 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 15:22:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928742274] [2024-10-25 15:22:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928742274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:22:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056505626] [2024-10-25 15:22:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:22:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:22:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:22:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:39,178 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:39,178 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 15:22:39,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:39,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-25 15:22:40,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2002564225, now seen corresponding path program 2 times [2024-10-25 15:22:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668832181] [2024-10-25 15:22:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:41,281 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 15:22:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:41,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668832181] [2024-10-25 15:22:41,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668832181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:41,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:41,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:22:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393926938] [2024-10-25 15:22:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:41,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:22:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:22:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:22:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:41,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 4 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 15:22:41,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:41,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:41,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:22:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:22:46,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-25 15:22:46,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1822708930, now seen corresponding path program 1 times [2024-10-25 15:22:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927893500] [2024-10-25 15:22:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:22:46,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:22:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:22:46,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:22:46,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:22:46,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:22:46,276 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:22:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-10-25 15:22:46,277 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:22:46,277 WARN L239 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:22:46,277 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-10-25 15:22:46,458 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-25 15:22:46,462 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:22:46,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:22:46,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:22:46,464 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 15:22:46,464 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 15:22:46,467 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:22:46,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:22:46,469 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:22:46,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:22:53,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:22:53,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:22:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1901727298, now seen corresponding path program 1 times [2024-10-25 15:22:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:22:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771880014] [2024-10-25 15:22:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:22:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:22:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:22:53,038 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 15:22:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:22:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771880014] [2024-10-25 15:22:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771880014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:22:53,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:22:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:22:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990360762] [2024-10-25 15:22:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:22:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:22:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:22:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:22:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:22:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:22:53,040 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:22:53,040 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 15:22:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:09,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-10-25 15:23:09,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -88900138, now seen corresponding path program 1 times [2024-10-25 15:23:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206361078] [2024-10-25 15:23:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:23:09,687 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 15:23:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:23:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206361078] [2024-10-25 15:23:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206361078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:23:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:23:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:23:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056381310] [2024-10-25 15:23:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:23:09,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:23:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:23:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:23:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:23:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:09,688 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:23:09,688 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 15:23:09,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:09,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-10-25 15:23:11,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1155560582, now seen corresponding path program 2 times [2024-10-25 15:23:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784776375] [2024-10-25 15:23:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:23:11,875 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 15:23:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:23:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784776375] [2024-10-25 15:23:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784776375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:23:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:23:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:23:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714852194] [2024-10-25 15:23:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:23:11,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:23:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:23:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:23:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:23:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:11,877 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:23:11,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 4 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 15:23:11,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:11,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:11,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:23:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-10-25 15:23:17,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:17,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash -681754018, now seen corresponding path program 1 times [2024-10-25 15:23:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:17,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396203997] [2024-10-25 15:23:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:23:17,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:23:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:23:17,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:23:17,894 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:23:17,894 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:23:17,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:23:17,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-10-25 15:23:17,895 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:23:17,895 WARN L239 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:23:17,896 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-10-25 15:23:17,933 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-10-25 15:23:17,937 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:23:17,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:23:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:23:17,939 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 15:23:17,940 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 15:23:17,945 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:23:17,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:23:17,946 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:23:17,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:23:25,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 716589874, now seen corresponding path program 1 times [2024-10-25 15:23:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:25,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097640141] [2024-10-25 15:23:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:23:25,247 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 15:23:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:23:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097640141] [2024-10-25 15:23:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097640141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:23:25,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:23:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:23:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614343007] [2024-10-25 15:23:25,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:23:25,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:23:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:23:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:23:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:23:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:25,249 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:23:25,249 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 15:23:25,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-10-25 15:23:43,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1173825561, now seen corresponding path program 1 times [2024-10-25 15:23:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762325357] [2024-10-25 15:23:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:23:43,835 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 15:23:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:23:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762325357] [2024-10-25 15:23:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762325357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:23:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:23:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:23:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852098847] [2024-10-25 15:23:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:23:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:23:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:23:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:23:43,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:23:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:43,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:23:43,837 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 15:23:43,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:43,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:45,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-10-25 15:23:45,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:45,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 967670753, now seen corresponding path program 2 times [2024-10-25 15:23:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164857424] [2024-10-25 15:23:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:23:46,207 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 15:23:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:23:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164857424] [2024-10-25 15:23:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164857424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:23:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:23:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:23:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806143683] [2024-10-25 15:23:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:23:46,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:23:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:23:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:23:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:23:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:46,208 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:23:46,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 4 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 15:23:46,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:46,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:46,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:23:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:23:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:23:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-10-25 15:23:52,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:23:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:23:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash -875251584, now seen corresponding path program 1 times [2024-10-25 15:23:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:23:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752592541] [2024-10-25 15:23:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:23:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:23:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:23:52,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:23:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:23:52,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:23:52,714 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:23:52,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:23:52,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:23:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-10-25 15:23:52,715 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:23:52,715 WARN L239 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:23:52,715 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-10-25 15:23:52,757 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-10-25 15:23:52,762 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:23:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:23:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:23:52,764 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 15:23:52,766 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 15:23:52,769 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:23:52,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:23:52,769 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:23:52,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:24:00,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:24:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:24:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 788321416, now seen corresponding path program 1 times [2024-10-25 15:24:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:24:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227790386] [2024-10-25 15:24:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:24:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:24:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:24:00,626 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 15:24:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:24:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227790386] [2024-10-25 15:24:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227790386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:24:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:24:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:24:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947182193] [2024-10-25 15:24:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:24:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:24:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:24:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:24:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:24:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:00,627 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:24:00,627 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 15:24:00,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:20,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-10-25 15:24:20,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:24:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:24:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1429666173, now seen corresponding path program 1 times [2024-10-25 15:24:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:24:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193409623] [2024-10-25 15:24:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:24:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:24:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:24:21,032 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 15:24:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:24:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193409623] [2024-10-25 15:24:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193409623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:24:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:24:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:24:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167878984] [2024-10-25 15:24:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:24:21,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:24:21,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:24:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:24:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:24:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:21,034 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:24:21,034 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 15:24:21,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:21,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:24:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-10-25 15:24:22,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:24:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:24:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 877475747, now seen corresponding path program 2 times [2024-10-25 15:24:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:24:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190539985] [2024-10-25 15:24:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:24:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:24:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:24:23,230 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 15:24:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:24:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190539985] [2024-10-25 15:24:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190539985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:24:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:24:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:24:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494099127] [2024-10-25 15:24:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:24:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:24:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:24:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:24:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:24:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:23,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:24:23,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 4 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 15:24:23,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:23,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:24:23,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:24:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:24:30,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-10-25 15:24:30,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:24:30,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:24:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1042158880, now seen corresponding path program 1 times [2024-10-25 15:24:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:24:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540454716] [2024-10-25 15:24:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:24:30,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:24:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:24:30,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:24:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:24:31,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:24:31,026 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:24:31,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:24:31,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:24:31,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-10-25 15:24:31,027 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:24:31,027 WARN L239 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:24:31,027 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-10-25 15:24:31,092 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-10-25 15:24:31,096 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:24:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:24:31,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:24:31,099 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 15:24:31,100 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 15:24:31,103 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:24:31,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:24:31,104 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:24:31,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:24:39,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:24:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:24:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 821622411, now seen corresponding path program 1 times [2024-10-25 15:24:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:24:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297618807] [2024-10-25 15:24:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:24:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:24:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:24:39,897 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 15:24:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:24:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297618807] [2024-10-25 15:24:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297618807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:24:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:24:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:24:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178853108] [2024-10-25 15:24:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:24:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:24:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:24:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:24:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:24:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:24:39,898 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:24:39,898 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 15:24:39,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:02,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-10-25 15:25:02,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:02,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash -442994314, now seen corresponding path program 1 times [2024-10-25 15:25:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910046344] [2024-10-25 15:25:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:25:02,280 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 15:25:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:25:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910046344] [2024-10-25 15:25:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910046344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:25:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:25:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:25:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174370557] [2024-10-25 15:25:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:25:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:25:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:25:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:25:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:25:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:02,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:25:02,282 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 15:25:02,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:02,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:04,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-10-25 15:25:04,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:04,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1098009038, now seen corresponding path program 2 times [2024-10-25 15:25:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2229454] [2024-10-25 15:25:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:04,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:25:04,470 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 15:25:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:25:04,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2229454] [2024-10-25 15:25:04,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2229454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:25:04,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:25:04,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:25:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057856344] [2024-10-25 15:25:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:25:04,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:25:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:25:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:25:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:25:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:04,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:25:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 4 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 15:25:04,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:04,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:04,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:25:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-10-25 15:25:12,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1713406625, now seen corresponding path program 1 times [2024-10-25 15:25:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072377602] [2024-10-25 15:25:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:25:12,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:25:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:25:13,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:25:13,050 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:25:13,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:25:13,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:25:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-10-25 15:25:13,051 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:25:13,051 WARN L239 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:25:13,051 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-10-25 15:25:13,099 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-10-25 15:25:13,102 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:25:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:25:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:25:13,105 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 15:25:13,106 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 15:25:13,109 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:25:13,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:25:13,110 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:25:13,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:25:22,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1617856758, now seen corresponding path program 1 times [2024-10-25 15:25:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258095276] [2024-10-25 15:25:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:25:22,657 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 15:25:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:25:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258095276] [2024-10-25 15:25:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258095276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:25:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:25:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:25:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655573882] [2024-10-25 15:25:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:25:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:25:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:25:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:25:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:25:22,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:22,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:25:22,658 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 15:25:22,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:46,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-10-25 15:25:46,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:46,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1879315949, now seen corresponding path program 1 times [2024-10-25 15:25:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433209664] [2024-10-25 15:25:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:25:46,956 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 15:25:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:25:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433209664] [2024-10-25 15:25:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433209664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:25:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:25:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:25:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164989658] [2024-10-25 15:25:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:25:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:25:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:25:46,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:25:46,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:25:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:46,957 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:25:46,957 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 15:25:46,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:46,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:48,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-10-25 15:25:48,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:48,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2118023367, now seen corresponding path program 2 times [2024-10-25 15:25:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:48,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745972674] [2024-10-25 15:25:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:25:49,182 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 15:25:49,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:25:49,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745972674] [2024-10-25 15:25:49,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745972674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:25:49,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:25:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:25:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306768418] [2024-10-25 15:25:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:25:49,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:25:49,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:25:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:25:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:25:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:49,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:25:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 4 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 15:25:49,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:49,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:49,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:25:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:25:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:25:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-10-25 15:25:58,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:25:58,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:25:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 138800030, now seen corresponding path program 1 times [2024-10-25 15:25:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:25:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964664895] [2024-10-25 15:25:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:25:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:25:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:25:58,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:25:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:25:58,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:25:58,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:25:58,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:25:58,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:25:58,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-10-25 15:25:58,115 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:25:58,115 WARN L239 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:25:58,115 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-10-25 15:25:58,163 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-10-25 15:25:58,166 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:25:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:25:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:25:58,168 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 15:25:58,168 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 15:25:58,173 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:25:58,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:25:58,174 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:25:58,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:26:08,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:26:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:26:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 921148456, now seen corresponding path program 1 times [2024-10-25 15:26:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:26:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732119653] [2024-10-25 15:26:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:26:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:26:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:26:08,455 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 15:26:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:26:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732119653] [2024-10-25 15:26:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732119653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:26:08,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:26:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:26:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900715098] [2024-10-25 15:26:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:26:08,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:26:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:26:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:26:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:26:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:08,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:26:08,457 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 15:26:08,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-10-25 15:26:34,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:26:34,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:26:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2110991597, now seen corresponding path program 1 times [2024-10-25 15:26:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:26:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620581097] [2024-10-25 15:26:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:26:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:26:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:26:34,479 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 15:26:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:26:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620581097] [2024-10-25 15:26:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620581097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:26:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:26:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:26:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951032068] [2024-10-25 15:26:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:26:34,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:26:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:26:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:26:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:26:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:34,480 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:26:34,481 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 15:26:34,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:34,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:26:36,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-10-25 15:26:36,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:26:36,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:26:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash -983285233, now seen corresponding path program 2 times [2024-10-25 15:26:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:26:36,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489758531] [2024-10-25 15:26:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:26:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:26:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:26:36,750 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 15:26:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:26:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489758531] [2024-10-25 15:26:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489758531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:26:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:26:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:26:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700133707] [2024-10-25 15:26:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:26:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:26:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:26:36,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:26:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:26:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:36,751 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:26:36,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 4 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 15:26:36,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:36,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:26:36,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:26:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:26:46,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-10-25 15:26:46,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:26:46,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:26:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash -84470331, now seen corresponding path program 1 times [2024-10-25 15:26:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:26:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842018344] [2024-10-25 15:26:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:26:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:26:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:26:46,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:26:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:26:46,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:26:46,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:26:46,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:26:46,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:26:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-10-25 15:26:46,729 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:26:46,729 WARN L239 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:26:46,729 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-10-25 15:26:46,778 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-10-25 15:26:46,781 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:26:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:26:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:26:46,783 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 15:26:46,784 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 15:26:46,787 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:26:46,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:26:46,788 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:26:46,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:26:57,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:26:57,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:26:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1483779508, now seen corresponding path program 1 times [2024-10-25 15:26:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:26:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378706344] [2024-10-25 15:26:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:26:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:26:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:26:57,943 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 15:26:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:26:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378706344] [2024-10-25 15:26:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378706344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:26:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:26:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:26:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055929149] [2024-10-25 15:26:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:26:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:26:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:26:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:26:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:26:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:26:57,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:26:57,944 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 15:26:57,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:26,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-10-25 15:27:26,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:27:26,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:27:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -717742286, now seen corresponding path program 1 times [2024-10-25 15:27:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:27:26,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522695536] [2024-10-25 15:27:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:27:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:27:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:27:26,296 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:27:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:27:26,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522695536] [2024-10-25 15:27:26,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522695536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:27:26,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:27:26,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:27:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765554975] [2024-10-25 15:27:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:27:26,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:27:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:27:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:27:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:27:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:26,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:27:26,297 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:27:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:27:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-10-25 15:27:28,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:27:28,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:27:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1075538966, now seen corresponding path program 2 times [2024-10-25 15:27:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:27:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460554433] [2024-10-25 15:27:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:27:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:27:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:27:28,703 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:27:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:27:28,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460554433] [2024-10-25 15:27:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460554433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:27:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:27:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:27:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212995252] [2024-10-25 15:27:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:27:28,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:27:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:27:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:27:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:27:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:28,705 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:27:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 4 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:27:28,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:28,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:27:28,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:27:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:27:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-10-25 15:27:39,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:27:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:27:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1786142589, now seen corresponding path program 1 times [2024-10-25 15:27:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:27:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637791996] [2024-10-25 15:27:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:27:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:27:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:27:39,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:27:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:27:39,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:27:39,905 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:27:39,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:27:39,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:27:39,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-10-25 15:27:39,906 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:27:39,907 WARN L239 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:27:39,907 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-10-25 15:27:39,955 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-10-25 15:27:39,959 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:27:39,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:27:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:27:39,961 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:27:39,961 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:27:39,965 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:27:39,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:27:39,965 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:27:39,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:27:51,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:27:51,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:27:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1969129095, now seen corresponding path program 1 times [2024-10-25 15:27:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:27:51,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609796425] [2024-10-25 15:27:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:27:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:27:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:27:52,025 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:27:52,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:27:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609796425] [2024-10-25 15:27:52,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609796425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:27:52,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:27:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:27:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564956455] [2024-10-25 15:27:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:27:52,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:27:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:27:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:27:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:27:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:27:52,026 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:27:52,026 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:27:52,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:21,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-10-25 15:28:21,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:28:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:28:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 986415421, now seen corresponding path program 1 times [2024-10-25 15:28:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:28:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199305297] [2024-10-25 15:28:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:28:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:28:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:28:21,912 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:28:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:28:21,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199305297] [2024-10-25 15:28:21,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199305297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:28:21,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:28:21,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:28:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646061180] [2024-10-25 15:28:21,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:28:21,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:28:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:28:21,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:28:21,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:28:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:21,913 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:28:21,913 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:28:21,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:21,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:28:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-10-25 15:28:23,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:28:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:28:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2006920683, now seen corresponding path program 2 times [2024-10-25 15:28:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:28:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123398057] [2024-10-25 15:28:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:28:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:28:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:28:24,324 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:28:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:28:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123398057] [2024-10-25 15:28:24,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123398057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:28:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:28:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:28:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454279096] [2024-10-25 15:28:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:28:24,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:28:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:28:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:28:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:28:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:24,325 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:28:24,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 4 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:28:24,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:24,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:28:24,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:28:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:28:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-10-25 15:28:35,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:28:35,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:28:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -315177454, now seen corresponding path program 1 times [2024-10-25 15:28:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:28:35,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874306770] [2024-10-25 15:28:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:28:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:28:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:28:35,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:28:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:28:35,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:28:35,808 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:28:35,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:28:35,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:28:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-10-25 15:28:35,808 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:28:35,809 WARN L239 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:28:35,809 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-10-25 15:28:35,861 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-10-25 15:28:35,865 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:28:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:28:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:28:35,866 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:28:35,867 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:28:35,870 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:28:35,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:28:35,870 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:28:35,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:28:48,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:28:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:28:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1823787782, now seen corresponding path program 1 times [2024-10-25 15:28:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:28:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307970422] [2024-10-25 15:28:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:28:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:28:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:28:48,872 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:28:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:28:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307970422] [2024-10-25 15:28:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307970422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:28:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:28:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:28:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47649103] [2024-10-25 15:28:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:28:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:28:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:28:48,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:28:48,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:28:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:28:48,874 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:28:48,874 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:28:48,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:21,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-10-25 15:29:21,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:29:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:29:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2052899071, now seen corresponding path program 1 times [2024-10-25 15:29:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:29:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374254389] [2024-10-25 15:29:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:29:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:29:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:29:21,663 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:29:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:29:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374254389] [2024-10-25 15:29:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374254389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:29:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:29:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:29:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586215608] [2024-10-25 15:29:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:29:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:29:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:29:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:29:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:29:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:21,664 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:29:21,665 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:29:21,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:21,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:29:23,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-10-25 15:29:23,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:29:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:29:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -208455881, now seen corresponding path program 2 times [2024-10-25 15:29:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:29:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105457861] [2024-10-25 15:29:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:29:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:29:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:29:24,227 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:29:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:29:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105457861] [2024-10-25 15:29:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105457861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:29:24,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:29:24,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:29:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113733480] [2024-10-25 15:29:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:29:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:29:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:29:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:29:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:29:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:24,229 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:29:24,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 4 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:29:24,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:24,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:29:24,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:29:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:29:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-10-25 15:29:37,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:29:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:29:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -601523561, now seen corresponding path program 1 times [2024-10-25 15:29:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:29:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147236762] [2024-10-25 15:29:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:29:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:29:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:29:37,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:29:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:29:37,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:29:37,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:29:37,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:29:37,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:29:37,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-10-25 15:29:37,437 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:29:37,438 WARN L239 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:29:37,438 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-10-25 15:29:37,490 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-10-25 15:29:37,494 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:29:37,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:29:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:29:37,496 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:29:37,497 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:29:37,499 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:29:37,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:29:37,500 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:29:37,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:29:51,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:29:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:29:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -288184302, now seen corresponding path program 1 times [2024-10-25 15:29:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:29:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247559656] [2024-10-25 15:29:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:29:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:29:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:29:51,724 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:29:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:29:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247559656] [2024-10-25 15:29:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247559656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:29:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:29:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:29:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020750102] [2024-10-25 15:29:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:29:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:29:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:29:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:29:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:29:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:29:51,726 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:29:51,726 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:29:51,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-10-25 15:30:26,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:30:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:30:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 590929120, now seen corresponding path program 1 times [2024-10-25 15:30:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:30:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852812145] [2024-10-25 15:30:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:30:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:30:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:30:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2024-10-25 15:30:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:30:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852812145] [2024-10-25 15:30:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852812145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:30:26,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:30:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:30:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374381847] [2024-10-25 15:30:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:30:26,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:30:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:30:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:30:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:30:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:26,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:30:26,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:30:26,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:26,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:30:29,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-10-25 15:30:29,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:30:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:30:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -672849180, now seen corresponding path program 2 times [2024-10-25 15:30:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:30:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583367395] [2024-10-25 15:30:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:30:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:30:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:30:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2024-10-25 15:30:29,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:30:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583367395] [2024-10-25 15:30:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583367395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:30:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:30:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:30:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560465882] [2024-10-25 15:30:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:30:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:30:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:30:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:30:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:30:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:29,603 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:30:29,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 4 states have internal predecessors, (472), 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:30:29,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:29,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:30:29,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:30:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:30:43,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-10-25 15:30:43,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:30:43,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:30:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1827895656, now seen corresponding path program 1 times [2024-10-25 15:30:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:30:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877385632] [2024-10-25 15:30:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:30:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:30:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:30:43,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:30:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:30:43,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:30:43,930 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:30:43,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:30:43,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:30:43,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-10-25 15:30:43,930 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:30:43,931 WARN L239 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:30:43,931 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-10-25 15:30:43,981 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-10-25 15:30:43,984 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:30:43,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:30:43,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:30:43,986 INFO L229 MonitoredProcess]: Starting monitored process 29 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:30:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process [2024-10-25 15:30:43,990 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:30:43,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:30:43,990 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:30:43,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:30:59,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:30:59,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:30:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 267227264, now seen corresponding path program 1 times [2024-10-25 15:30:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:30:59,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271144027] [2024-10-25 15:30:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:30:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:30:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:30:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2024-10-25 15:30:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:30:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271144027] [2024-10-25 15:30:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271144027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:30:59,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:30:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:30:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807173528] [2024-10-25 15:30:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:30:59,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:30:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:30:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:30:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:30:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:30:59,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:30:59,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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:30:59,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-10-25 15:31:36,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:31:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:31:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 856832244, now seen corresponding path program 1 times [2024-10-25 15:31:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:31:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676297747] [2024-10-25 15:31:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:31:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:31:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:31:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2024-10-25 15:31:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:31:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676297747] [2024-10-25 15:31:36,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676297747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:31:36,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:31:36,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:31:36,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523699410] [2024-10-25 15:31:36,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:31:36,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:31:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:31:36,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:31:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:31:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:36,785 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:31:36,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:31:36,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:36,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:31:38,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-10-25 15:31:38,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:31:38,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:31:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1451603464, now seen corresponding path program 2 times [2024-10-25 15:31:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:31:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119452728] [2024-10-25 15:31:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:31:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:31:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:31:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-25 15:31:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:31:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119452728] [2024-10-25 15:31:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119452728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:31:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:31:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 15:31:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055881036] [2024-10-25 15:31:39,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:31:39,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-25 15:31:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:31:39,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 15:31:39,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-25 15:31:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:39,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:31:39,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 4 states have internal predecessors, (490), 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:31:39,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:39,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:31:39,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:31:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:31:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:31:54,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-10-25 15:31:54,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:31:54,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:31:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 127932865, now seen corresponding path program 1 times [2024-10-25 15:31:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:31:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604010080] [2024-10-25 15:31:54,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:31:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:31:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:31:54,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:31:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:31:54,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:31:54,427 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:31:54,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:31:54,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:31:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-10-25 15:31:54,428 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-10-25 15:31:54,428 WARN L239 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:31:54,428 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-10-25 15:31:54,477 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-10-25 15:31:54,481 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:31:54,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:31:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:31:54,482 INFO L229 MonitoredProcess]: Starting monitored process 30 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:31:54,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2024-10-25 15:31:54,487 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:31:54,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:31:54,488 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;@61d4a590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:31:54,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:32:10,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:32:10,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:32:10,640 INFO L85 PathProgramCache]: Analyzing trace with hash -540725765, now seen corresponding path program 1 times [2024-10-25 15:32:10,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:32:10,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49599470] [2024-10-25 15:32:10,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:32:10,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:32:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:32:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2024-10-25 15:32:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:32:10,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49599470] [2024-10-25 15:32:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49599470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:32:10,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:32:10,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:32:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485497251] [2024-10-25 15:32:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:32:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-25 15:32:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:32:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 15:32:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 15:32:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:32:10,693 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:32:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 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:32:10,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15