./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 12:25:50,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 12:25:50,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 12:25:50,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 12:25:50,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 12:25:50,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 12:25:50,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 12:25:50,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 12:25:50,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 12:25:50,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 12:25:50,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 12:25:50,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 12:25:50,833 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 12:25:50,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 12:25:50,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 12:25:50,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 12:25:50,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 12:25:50,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 12:25:50,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-jdk21/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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 12:25:51,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 12:25:51,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 12:25:51,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 12:25:51,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 12:25:51,052 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 12:25:51,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-17 12:25:52,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/9f118dbac/1dae100c61264ab58d1dd50464cbac88/FLAG6fc3e2593 [2024-12-17 12:25:52,354 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 12:25:52,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-17 12:25:52,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/9f118dbac/1dae100c61264ab58d1dd50464cbac88/FLAG6fc3e2593 [2024-12-17 12:25:52,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/9f118dbac/1dae100c61264ab58d1dd50464cbac88 [2024-12-17 12:25:52,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 12:25:52,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 12:25:52,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 12:25:52,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 12:25:52,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 12:25:52,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3807692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52, skipping insertion in model container [2024-12-17 12:25:52,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 12:25:52,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i[30176,30189] [2024-12-17 12:25:52,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 12:25:52,651 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 12:25:52,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i[30176,30189] [2024-12-17 12:25:52,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 12:25:52,699 INFO L204 MainTranslator]: Completed translation [2024-12-17 12:25:52,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52 WrapperNode [2024-12-17 12:25:52,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 12:25:52,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 12:25:52,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 12:25:52,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 12:25:52,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,727 INFO L138 Inliner]: procedures = 172, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-12-17 12:25:52,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 12:25:52,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 12:25:52,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 12:25:52,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 12:25:52,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 12:25:52,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 12:25:52,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 12:25:52,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 12:25:52,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (1/1) ... [2024-12-17 12:25:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 12:25:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 12:25:52,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 12:25:52,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 12:25:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-17 12:25:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-17 12:25:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-17 12:25:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-17 12:25:52,804 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-17 12:25:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 12:25:52,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 12:25:52,805 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 12:25:52,907 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 12:25:52,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 12:25:53,043 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 12:25:53,043 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 12:25:53,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 12:25:53,141 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-12-17 12:25:53,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:25:53 BoogieIcfgContainer [2024-12-17 12:25:53,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 12:25:53,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 12:25:53,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 12:25:53,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 12:25:53,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:25:52" (1/3) ... [2024-12-17 12:25:53,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce0ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:25:53, skipping insertion in model container [2024-12-17 12:25:53,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:25:52" (2/3) ... [2024-12-17 12:25:53,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce0ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:25:53, skipping insertion in model container [2024-12-17 12:25:53,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:25:53" (3/3) ... [2024-12-17 12:25:53,149 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-12-17 12:25:53,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 12:25:53,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 39 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-12-17 12:25:53,160 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 12:25:53,185 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-17 12:25:53,223 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:53,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 12:25:53,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 12:25:53,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 12:25:53,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 12:25:53,275 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:25:53,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:25:53,293 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:53,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:25:53,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:53,438 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:53,438 INFO L139 ounterexampleChecker]: Examining path program with hash -681307041, occurence #1 [2024-12-17 12:25:53,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:53,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1491121949, now seen corresponding path program 1 times [2024-12-17 12:25:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620781645] [2024-12-17 12:25:53,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620781645] [2024-12-17 12:25:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620781645] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:25:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720785983] [2024-12-17 12:25:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:25:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:53,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:25:53,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:25:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:53,604 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:53,606 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-12-17 12:25:53,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:53,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 12:25:53,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:53,737 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:53,738 INFO L139 ounterexampleChecker]: Examining path program with hash 2140457754, occurence #1 [2024-12-17 12:25:53,738 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:53,738 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -355989861, now seen corresponding path program 1 times [2024-12-17 12:25:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:53,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477718532] [2024-12-17 12:25:53,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:53,763 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:25:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:53,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:25:53,801 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:25:53,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:25:53,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:25:53,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-17 12:25:53,809 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 12:25:53,810 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:25:53,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-17 12:25:53,827 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-17 12:25:53,830 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:53,836 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:25:53,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:25:53,837 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:53,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:25:54,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:54,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:54,041 INFO L139 ounterexampleChecker]: Examining path program with hash 1338776479, occurence #1 [2024-12-17 12:25:54,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:54,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1748138305, now seen corresponding path program 1 times [2024-12-17 12:25:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652068203] [2024-12-17 12:25:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652068203] [2024-12-17 12:25:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652068203] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:25:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396604292] [2024-12-17 12:25:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:25:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:54,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:25:54,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:25:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,093 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:54,093 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-12-17 12:25:54,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-17 12:25:54,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:54,462 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:54,462 INFO L139 ounterexampleChecker]: Examining path program with hash 87981475, occurence #1 [2024-12-17 12:25:54,462 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:54,462 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:54,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash -728860690, now seen corresponding path program 1 times [2024-12-17 12:25:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132146722] [2024-12-17 12:25:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132146722] [2024-12-17 12:25:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132146722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:54,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:25:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080717218] [2024-12-17 12:25:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:25:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:54,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:25:54,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:25:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:54,575 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-12-17 12:25:54,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-17 12:25:54,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:54,656 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:54,656 INFO L139 ounterexampleChecker]: Examining path program with hash 1122593171, occurence #1 [2024-12-17 12:25:54,656 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:54,656 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1878364372, now seen corresponding path program 1 times [2024-12-17 12:25:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314337007] [2024-12-17 12:25:54,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314337007] [2024-12-17 12:25:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314337007] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:54,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:54,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-17 12:25:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584775743] [2024-12-17 12:25:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 12:25:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:54,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 12:25:54,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-17 12:25:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:54,842 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-12-17 12:25:54,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:54,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:25:54,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-17 12:25:54,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:54,908 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:54,908 INFO L139 ounterexampleChecker]: Examining path program with hash -55038103, occurence #1 [2024-12-17 12:25:54,908 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:54,908 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 158377459, now seen corresponding path program 1 times [2024-12-17 12:25:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265464633] [2024-12-17 12:25:54,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:54,926 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:25:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:54,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:25:54,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:25:54,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:25:54,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:25:54,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-17 12:25:54,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:25:54,944 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:25:54,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-17 12:25:54,957 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-17 12:25:54,961 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:54,967 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:25:54,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:25:54,969 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:54,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:25:55,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:55,238 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:55,238 INFO L139 ounterexampleChecker]: Examining path program with hash -1286168467, occurence #1 [2024-12-17 12:25:55,238 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:55,238 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:55,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1201107194, now seen corresponding path program 1 times [2024-12-17 12:25:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961884510] [2024-12-17 12:25:55,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961884510] [2024-12-17 12:25:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961884510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:55,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:25:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663535910] [2024-12-17 12:25:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:55,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:25:55,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:55,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:25:55,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:25:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:55,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:55,259 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-12-17 12:25:55,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-17 12:25:55,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:55,923 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:55,923 INFO L139 ounterexampleChecker]: Examining path program with hash -1039592091, occurence #1 [2024-12-17 12:25:55,923 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:55,923 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2124365410, now seen corresponding path program 1 times [2024-12-17 12:25:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682272072] [2024-12-17 12:25:55,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:55,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682272072] [2024-12-17 12:25:55,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682272072] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:55,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:55,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:25:55,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617651316] [2024-12-17 12:25:55,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:55,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:25:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:56,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:25:56,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:25:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,000 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:56,000 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-12-17 12:25:56,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:56,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-17 12:25:56,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:56,124 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:56,124 INFO L139 ounterexampleChecker]: Examining path program with hash 1541089494, occurence #1 [2024-12-17 12:25:56,124 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:56,124 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:56,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash 745274581, now seen corresponding path program 1 times [2024-12-17 12:25:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512103878] [2024-12-17 12:25:56,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512103878] [2024-12-17 12:25:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512103878] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:25:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282843456] [2024-12-17 12:25:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:25:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:56,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:25:56,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:25:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,247 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:56,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:25:56,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:56,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:25:56,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-17 12:25:56,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:56,391 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:56,391 INFO L139 ounterexampleChecker]: Examining path program with hash -181581769, occurence #1 [2024-12-17 12:25:56,391 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:56,391 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:56,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash -847195528, now seen corresponding path program 1 times [2024-12-17 12:25:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337497343] [2024-12-17 12:25:56,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:56,405 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:25:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:56,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:25:56,422 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:25:56,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:25:56,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:25:56,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-17 12:25:56,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:25:56,424 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:25:56,424 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-17 12:25:56,445 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-17 12:25:56,449 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:56,458 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:25:56,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:25:56,458 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:56,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:25:56,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:56,826 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:56,827 INFO L139 ounterexampleChecker]: Examining path program with hash 1387886822, occurence #1 [2024-12-17 12:25:56,827 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:56,827 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -107213441, now seen corresponding path program 1 times [2024-12-17 12:25:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206897552] [2024-12-17 12:25:56,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206897552] [2024-12-17 12:25:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206897552] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:56,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:25:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821141382] [2024-12-17 12:25:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:25:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:56,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:25:56,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:25:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:56,850 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:56,850 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-12-17 12:25:56,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:57,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-17 12:25:57,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:57,901 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:57,901 INFO L139 ounterexampleChecker]: Examining path program with hash -1169756289, occurence #1 [2024-12-17 12:25:57,901 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:57,901 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:57,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -573673375, now seen corresponding path program 1 times [2024-12-17 12:25:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732842865] [2024-12-17 12:25:57,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732842865] [2024-12-17 12:25:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732842865] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:25:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072174253] [2024-12-17 12:25:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:58,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:25:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:58,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:25:58,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:25:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,009 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:58,009 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-12-17 12:25:58,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-17 12:25:58,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:58,147 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:58,147 INFO L139 ounterexampleChecker]: Examining path program with hash 1732929818, occurence #1 [2024-12-17 12:25:58,147 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:58,147 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -88915553, now seen corresponding path program 1 times [2024-12-17 12:25:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123620885] [2024-12-17 12:25:58,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123620885] [2024-12-17 12:25:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123620885] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:25:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945024479] [2024-12-17 12:25:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:58,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:25:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:58,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:25:58,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:25:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,252 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:58,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:25:58,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:58,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:25:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:25:58,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-17 12:25:58,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:58,386 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:58,386 INFO L139 ounterexampleChecker]: Examining path program with hash -1620388408, occurence #1 [2024-12-17 12:25:58,386 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:58,386 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash -858914796, now seen corresponding path program 1 times [2024-12-17 12:25:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638442829] [2024-12-17 12:25:58,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:58,399 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:25:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:25:58,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:25:58,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:25:58,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:25:58,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:25:58,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-17 12:25:58,420 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:25:58,421 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:25:58,421 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-17 12:25:58,434 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-17 12:25:58,436 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:58,443 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:25:58,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:25:58,444 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:25:58,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:25:58,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:25:58,894 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:25:58,894 INFO L139 ounterexampleChecker]: Examining path program with hash -1475019358, occurence #1 [2024-12-17 12:25:58,894 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:25:58,894 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:25:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:25:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1580712567, now seen corresponding path program 1 times [2024-12-17 12:25:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:25:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024962869] [2024-12-17 12:25:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:25:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:25:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:25:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:25:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:25:58,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024962869] [2024-12-17 12:25:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024962869] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:25:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:25:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:25:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467189898] [2024-12-17 12:25:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:25:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:25:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:25:58,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:25:58,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:25:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:25:58,928 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:25:58,928 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-12-17 12:25:58,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-17 12:26:00,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:00,175 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:00,175 INFO L139 ounterexampleChecker]: Examining path program with hash -386888126, occurence #1 [2024-12-17 12:26:00,175 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:00,175 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 429413043, now seen corresponding path program 1 times [2024-12-17 12:26:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:00,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657774597] [2024-12-17 12:26:00,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:00,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657774597] [2024-12-17 12:26:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657774597] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:00,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526571042] [2024-12-17 12:26:00,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:00,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:00,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:00,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:00,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,247 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:00,247 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-12-17 12:26:00,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-17 12:26:00,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:00,439 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:00,439 INFO L139 ounterexampleChecker]: Examining path program with hash 341888086, occurence #1 [2024-12-17 12:26:00,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:00,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 586458532, now seen corresponding path program 1 times [2024-12-17 12:26:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742758397] [2024-12-17 12:26:00,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742758397] [2024-12-17 12:26:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742758397] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196286890] [2024-12-17 12:26:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:00,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:00,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:00,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:00,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,559 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:00,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:00,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:00,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-17 12:26:00,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:00,819 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:00,819 INFO L139 ounterexampleChecker]: Examining path program with hash -1257972225, occurence #1 [2024-12-17 12:26:00,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:00,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1582456399, now seen corresponding path program 1 times [2024-12-17 12:26:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200596274] [2024-12-17 12:26:00,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:00,841 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:00,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:00,864 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:00,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:00,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:00,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-17 12:26:00,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:00,866 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:00,866 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-17 12:26:00,883 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-17 12:26:00,885 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:00,894 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:00,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:00,895 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:00,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:01,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:01,453 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:01,454 INFO L139 ounterexampleChecker]: Examining path program with hash 343180945, occurence #1 [2024-12-17 12:26:01,454 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:01,454 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:01,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1427026291, now seen corresponding path program 1 times [2024-12-17 12:26:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743402594] [2024-12-17 12:26:01,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743402594] [2024-12-17 12:26:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743402594] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:01,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:01,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147318517] [2024-12-17 12:26:01,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:01,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:01,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:01,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:01,472 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-12-17 12:26:01,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-17 12:26:03,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:03,069 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:03,069 INFO L139 ounterexampleChecker]: Examining path program with hash -1765765130, occurence #1 [2024-12-17 12:26:03,069 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:03,069 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:03,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash -227236987, now seen corresponding path program 1 times [2024-12-17 12:26:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192828135] [2024-12-17 12:26:03,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:03,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:03,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192828135] [2024-12-17 12:26:03,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192828135] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:03,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542338679] [2024-12-17 12:26:03,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:03,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:03,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:03,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:03,139 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-12-17 12:26:03,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:03,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-17 12:26:03,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:03,406 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:03,407 INFO L139 ounterexampleChecker]: Examining path program with hash 543774237, occurence #1 [2024-12-17 12:26:03,407 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:03,407 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash -656592651, now seen corresponding path program 1 times [2024-12-17 12:26:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:03,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381975157] [2024-12-17 12:26:03,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381975157] [2024-12-17 12:26:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381975157] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:03,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770097703] [2024-12-17 12:26:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:03,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:03,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:03,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:03,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-17 12:26:03,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:03,866 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:03,866 INFO L139 ounterexampleChecker]: Examining path program with hash 910589937, occurence #1 [2024-12-17 12:26:03,866 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:03,867 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1206298771, now seen corresponding path program 1 times [2024-12-17 12:26:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073840354] [2024-12-17 12:26:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:03,881 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:03,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:03,903 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:03,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:03,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-17 12:26:03,904 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:03,905 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:03,905 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-12-17 12:26:03,920 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-12-17 12:26:03,921 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:03,931 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:03,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:03,931 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:03,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:04,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:04,600 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:04,600 INFO L139 ounterexampleChecker]: Examining path program with hash -95245318, occurence #1 [2024-12-17 12:26:04,600 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:04,600 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 636756740, now seen corresponding path program 1 times [2024-12-17 12:26:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217097510] [2024-12-17 12:26:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217097510] [2024-12-17 12:26:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217097510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624008166] [2024-12-17 12:26:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:04,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:04,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:04,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:04,621 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:04,622 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-12-17 12:26:04,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-17 12:26:06,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:06,576 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:06,576 INFO L139 ounterexampleChecker]: Examining path program with hash 1798521269, occurence #1 [2024-12-17 12:26:06,577 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:06,577 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -63371476, now seen corresponding path program 1 times [2024-12-17 12:26:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802060666] [2024-12-17 12:26:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802060666] [2024-12-17 12:26:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802060666] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:06,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009178867] [2024-12-17 12:26:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:06,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:06,693 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-12-17 12:26:06,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:06,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-17 12:26:07,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:07,026 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:07,026 INFO L139 ounterexampleChecker]: Examining path program with hash -52932809, occurence #1 [2024-12-17 12:26:07,026 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:07,026 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:07,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1425094247, now seen corresponding path program 1 times [2024-12-17 12:26:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328758322] [2024-12-17 12:26:07,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328758322] [2024-12-17 12:26:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328758322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:07,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:07,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181830039] [2024-12-17 12:26:07,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:07,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:07,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:07,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,132 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:07,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:07,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:07,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-17 12:26:07,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:07,552 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:07,552 INFO L139 ounterexampleChecker]: Examining path program with hash 515361209, occurence #1 [2024-12-17 12:26:07,552 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:07,552 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:07,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash -393909179, now seen corresponding path program 1 times [2024-12-17 12:26:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643638406] [2024-12-17 12:26:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:07,566 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:07,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:07,585 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:07,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:07,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-17 12:26:07,586 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:07,586 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:07,586 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-12-17 12:26:07,604 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-17 12:26:07,606 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:07,618 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:07,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:07,619 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:07,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:08,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:08,439 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:08,439 INFO L139 ounterexampleChecker]: Examining path program with hash -347114395, occurence #1 [2024-12-17 12:26:08,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:08,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -402590569, now seen corresponding path program 1 times [2024-12-17 12:26:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:08,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833124591] [2024-12-17 12:26:08,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:08,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833124591] [2024-12-17 12:26:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833124591] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:08,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:08,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098858489] [2024-12-17 12:26:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:08,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:08,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:08,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:08,458 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-12-17 12:26:08,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-17 12:26:11,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:11,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:11,028 INFO L139 ounterexampleChecker]: Examining path program with hash 448245337, occurence #1 [2024-12-17 12:26:11,028 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:11,028 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1045720687, now seen corresponding path program 1 times [2024-12-17 12:26:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462188526] [2024-12-17 12:26:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462188526] [2024-12-17 12:26:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462188526] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253530672] [2024-12-17 12:26:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:11,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:11,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:11,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,098 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:11,098 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-12-17 12:26:11,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-17 12:26:11,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:11,486 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:11,486 INFO L139 ounterexampleChecker]: Examining path program with hash -1084194856, occurence #1 [2024-12-17 12:26:11,486 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:11,486 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash -851778818, now seen corresponding path program 1 times [2024-12-17 12:26:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514225224] [2024-12-17 12:26:11,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514225224] [2024-12-17 12:26:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514225224] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263740954] [2024-12-17 12:26:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:11,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,623 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:11,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:11,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:11,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:11,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:12,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-17 12:26:12,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:12,120 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:12,120 INFO L139 ounterexampleChecker]: Examining path program with hash -500810495, occurence #1 [2024-12-17 12:26:12,120 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:12,120 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1036703890, now seen corresponding path program 1 times [2024-12-17 12:26:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323718264] [2024-12-17 12:26:12,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:12,136 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:12,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:12,157 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:12,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:12,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-17 12:26:12,158 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:12,159 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:12,159 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-12-17 12:26:12,177 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-12-17 12:26:12,179 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:12,195 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:12,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:12,197 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:12,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:13,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:13,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:13,156 INFO L139 ounterexampleChecker]: Examining path program with hash -1617584172, occurence #1 [2024-12-17 12:26:13,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:13,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -969193091, now seen corresponding path program 1 times [2024-12-17 12:26:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439115767] [2024-12-17 12:26:13,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:13,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439115767] [2024-12-17 12:26:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439115767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240797663] [2024-12-17 12:26:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:13,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:13,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:13,175 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:13,175 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-12-17 12:26:13,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-17 12:26:16,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:16,001 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:16,001 INFO L139 ounterexampleChecker]: Examining path program with hash 2028264675, occurence #1 [2024-12-17 12:26:16,001 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:16,001 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1951477731, now seen corresponding path program 1 times [2024-12-17 12:26:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512109182] [2024-12-17 12:26:16,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512109182] [2024-12-17 12:26:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512109182] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063702370] [2024-12-17 12:26:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:16,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:16,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,073 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:16,073 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-12-17 12:26:16,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:16,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-17 12:26:16,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:16,508 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:16,509 INFO L139 ounterexampleChecker]: Examining path program with hash -1176368383, occurence #1 [2024-12-17 12:26:16,509 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:16,509 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash 898198302, now seen corresponding path program 1 times [2024-12-17 12:26:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476845133] [2024-12-17 12:26:16,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:16,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476845133] [2024-12-17 12:26:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476845133] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:16,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492854614] [2024-12-17 12:26:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:16,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:16,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:16,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:16,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:16,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:16,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:16,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-17 12:26:17,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:17,373 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:17,373 INFO L139 ounterexampleChecker]: Examining path program with hash -2007068758, occurence #1 [2024-12-17 12:26:17,373 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:17,373 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1736306687, now seen corresponding path program 1 times [2024-12-17 12:26:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613423655] [2024-12-17 12:26:17,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:17,395 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:17,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:17,420 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:17,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:17,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-17 12:26:17,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:17,421 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:17,421 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-12-17 12:26:17,442 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-12-17 12:26:17,444 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:17,457 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:17,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:17,457 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:17,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:18,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:18,588 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:18,588 INFO L139 ounterexampleChecker]: Examining path program with hash -1193430971, occurence #1 [2024-12-17 12:26:18,588 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:18,588 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1952782269, now seen corresponding path program 1 times [2024-12-17 12:26:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:18,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034459648] [2024-12-17 12:26:18,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034459648] [2024-12-17 12:26:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034459648] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620318126] [2024-12-17 12:26:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:18,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:18,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:18,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:18,605 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:18,605 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-12-17 12:26:18,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-17 12:26:21,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:21,965 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:21,965 INFO L139 ounterexampleChecker]: Examining path program with hash 463031893, occurence #1 [2024-12-17 12:26:21,965 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:21,965 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1737131094, now seen corresponding path program 1 times [2024-12-17 12:26:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:21,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322332830] [2024-12-17 12:26:21,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322332830] [2024-12-17 12:26:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322332830] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803888839] [2024-12-17 12:26:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:22,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:22,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:22,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:22,086 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-12-17 12:26:22,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:22,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-17 12:26:22,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:22,553 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:22,553 INFO L139 ounterexampleChecker]: Examining path program with hash 42885115, occurence #1 [2024-12-17 12:26:22,553 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:22,554 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:22,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1065409539, now seen corresponding path program 1 times [2024-12-17 12:26:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:22,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904989606] [2024-12-17 12:26:22,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:22,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904989606] [2024-12-17 12:26:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904989606] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075912450] [2024-12-17 12:26:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:22,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:22,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:22,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,663 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:22,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:22,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:22,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:22,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:23,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-17 12:26:23,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:23,378 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:23,378 INFO L139 ounterexampleChecker]: Examining path program with hash 2079810143, occurence #1 [2024-12-17 12:26:23,378 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:23,378 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:23,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1090970219, now seen corresponding path program 1 times [2024-12-17 12:26:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861681586] [2024-12-17 12:26:23,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:23,394 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:23,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:23,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:23,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:23,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:23,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-17 12:26:23,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:23,418 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:23,418 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-12-17 12:26:23,439 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-12-17 12:26:23,441 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:23,501 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:23,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:23,502 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:23,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:24,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:24,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:24,766 INFO L139 ounterexampleChecker]: Examining path program with hash 1173617172, occurence #1 [2024-12-17 12:26:24,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:24,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 388212082, now seen corresponding path program 1 times [2024-12-17 12:26:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965196864] [2024-12-17 12:26:24,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965196864] [2024-12-17 12:26:24,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965196864] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:24,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787774855] [2024-12-17 12:26:24,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:24,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:24,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:24,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:24,783 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:24,783 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-12-17 12:26:24,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:28,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-17 12:26:28,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:28,582 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:28,582 INFO L139 ounterexampleChecker]: Examining path program with hash -1008457272, occurence #1 [2024-12-17 12:26:28,582 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:28,582 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:28,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 242212254, now seen corresponding path program 1 times [2024-12-17 12:26:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066903441] [2024-12-17 12:26:28,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:28,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:28,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066903441] [2024-12-17 12:26:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066903441] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:28,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033515435] [2024-12-17 12:26:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:28,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:28,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:28,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:28,661 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-12-17 12:26:28,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:28,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-17 12:26:29,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:29,243 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:29,243 INFO L139 ounterexampleChecker]: Examining path program with hash 279800942, occurence #1 [2024-12-17 12:26:29,243 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:29,243 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1744027082, now seen corresponding path program 1 times [2024-12-17 12:26:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857579207] [2024-12-17 12:26:29,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857579207] [2024-12-17 12:26:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857579207] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189789341] [2024-12-17 12:26:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:29,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:29,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:29,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:29,401 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:29,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:29,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:29,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-17 12:26:30,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:30,307 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:30,307 INFO L139 ounterexampleChecker]: Examining path program with hash 694185822, occurence #1 [2024-12-17 12:26:30,307 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:30,307 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1688405208, now seen corresponding path program 1 times [2024-12-17 12:26:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375151254] [2024-12-17 12:26:30,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:30,324 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:30,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:30,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:30,345 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:30,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-17 12:26:30,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:30,347 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:30,347 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-12-17 12:26:30,367 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-12-17 12:26:30,369 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:30,385 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:30,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:30,385 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:30,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:31,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:31,936 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:31,936 INFO L139 ounterexampleChecker]: Examining path program with hash 1952967929, occurence #1 [2024-12-17 12:26:31,936 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:31,936 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:31,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 463995955, now seen corresponding path program 1 times [2024-12-17 12:26:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911942577] [2024-12-17 12:26:31,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911942577] [2024-12-17 12:26:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911942577] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826114838] [2024-12-17 12:26:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:31,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:31,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:31,956 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:31,957 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-12-17 12:26:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:36,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-17 12:26:36,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:36,431 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:36,431 INFO L139 ounterexampleChecker]: Examining path program with hash 601967620, occurence #1 [2024-12-17 12:26:36,431 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:36,431 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:36,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1840545501, now seen corresponding path program 1 times [2024-12-17 12:26:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890183923] [2024-12-17 12:26:36,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890183923] [2024-12-17 12:26:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890183923] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798275117] [2024-12-17 12:26:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:36,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:36,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:36,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:36,545 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:36,546 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-12-17 12:26:36,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:36,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:37,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-17 12:26:37,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:37,192 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:37,192 INFO L139 ounterexampleChecker]: Examining path program with hash 362403273, occurence #1 [2024-12-17 12:26:37,192 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:37,192 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:37,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1279058506, now seen corresponding path program 1 times [2024-12-17 12:26:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311914487] [2024-12-17 12:26:37,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311914487] [2024-12-17 12:26:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311914487] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131722503] [2024-12-17 12:26:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:37,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:37,324 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:37,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:37,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:37,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:37,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:38,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-17 12:26:38,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:38,523 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:38,523 INFO L139 ounterexampleChecker]: Examining path program with hash 1096148172, occurence #1 [2024-12-17 12:26:38,523 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:38,523 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:38,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1656356936, now seen corresponding path program 1 times [2024-12-17 12:26:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638907310] [2024-12-17 12:26:38,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:38,542 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:38,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:38,564 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:38,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:38,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:38,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-17 12:26:38,566 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:38,566 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:38,566 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-12-17 12:26:38,590 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-12-17 12:26:38,595 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:38,611 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:38,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:38,612 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:38,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:40,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:40,317 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:40,317 INFO L139 ounterexampleChecker]: Examining path program with hash 597958854, occurence #1 [2024-12-17 12:26:40,317 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:40,317 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 661870167, now seen corresponding path program 1 times [2024-12-17 12:26:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381239226] [2024-12-17 12:26:40,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381239226] [2024-12-17 12:26:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381239226] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773338797] [2024-12-17 12:26:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:40,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:40,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:40,338 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:40,338 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-12-17 12:26:40,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-17 12:26:45,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:45,295 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:45,296 INFO L139 ounterexampleChecker]: Examining path program with hash 1332068267, occurence #1 [2024-12-17 12:26:45,296 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:45,296 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:45,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1110001148, now seen corresponding path program 1 times [2024-12-17 12:26:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801558231] [2024-12-17 12:26:45,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801558231] [2024-12-17 12:26:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801558231] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120979790] [2024-12-17 12:26:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:45,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:45,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:45,385 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:45,385 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-12-17 12:26:45,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:45,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-17 12:26:46,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:46,233 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:46,233 INFO L139 ounterexampleChecker]: Examining path program with hash 1095964340, occurence #1 [2024-12-17 12:26:46,233 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:46,233 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash -386597185, now seen corresponding path program 1 times [2024-12-17 12:26:46,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043589694] [2024-12-17 12:26:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:46,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043589694] [2024-12-17 12:26:46,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043589694] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:46,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:46,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558994639] [2024-12-17 12:26:46,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:46,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:46,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:46,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:46,427 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:46,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:47,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-17 12:26:47,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:47,691 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:47,691 INFO L139 ounterexampleChecker]: Examining path program with hash -839860263, occurence #1 [2024-12-17 12:26:47,691 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:47,691 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1923260504, now seen corresponding path program 1 times [2024-12-17 12:26:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666788295] [2024-12-17 12:26:47,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:47,710 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:47,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:47,732 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:47,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:47,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-17 12:26:47,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:47,734 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:47,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-12-17 12:26:47,758 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-12-17 12:26:47,760 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:47,781 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:47,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:47,782 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:47,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:26:49,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:49,820 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:49,820 INFO L139 ounterexampleChecker]: Examining path program with hash 246603331, occurence #1 [2024-12-17 12:26:49,820 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:49,820 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1409166811, now seen corresponding path program 1 times [2024-12-17 12:26:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313182846] [2024-12-17 12:26:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313182846] [2024-12-17 12:26:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313182846] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:49,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:49,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:26:49,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902552730] [2024-12-17 12:26:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:49,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:26:49,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:49,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:26:49,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:26:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:49,841 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:49,841 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-12-17 12:26:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:55,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-17 12:26:55,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:55,616 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:55,616 INFO L139 ounterexampleChecker]: Examining path program with hash 1741203011, occurence #1 [2024-12-17 12:26:55,616 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:55,616 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:55,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1451102031, now seen corresponding path program 1 times [2024-12-17 12:26:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:55,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306774288] [2024-12-17 12:26:55,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:55,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306774288] [2024-12-17 12:26:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306774288] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226436827] [2024-12-17 12:26:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:26:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:55,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:26:55,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:26:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:55,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:55,715 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-12-17 12:26:55,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:55,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-17 12:26:56,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:56,524 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:56,524 INFO L139 ounterexampleChecker]: Examining path program with hash -262095555, occurence #1 [2024-12-17 12:26:56,524 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:56,524 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:56,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2088776955, now seen corresponding path program 1 times [2024-12-17 12:26:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634137694] [2024-12-17 12:26:56,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:26:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:26:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:26:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634137694] [2024-12-17 12:26:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634137694] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:26:56,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:26:56,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:26:56,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596919333] [2024-12-17 12:26:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:26:56,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:26:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:26:56,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:26:56,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:26:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:56,702 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:26:56,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:26:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:26:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:26:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:26:58,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-12-17 12:26:58,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:26:58,649 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:26:58,649 INFO L139 ounterexampleChecker]: Examining path program with hash 890030172, occurence #1 [2024-12-17 12:26:58,649 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:26:58,649 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:26:58,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:26:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1249303733, now seen corresponding path program 1 times [2024-12-17 12:26:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:26:58,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006159766] [2024-12-17 12:26:58,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:26:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:26:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:58,678 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:26:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:26:58,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:26:58,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:26:58,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:26:58,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:26:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-17 12:26:58,704 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-17 12:26:58,705 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:26:58,705 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-12-17 12:26:58,731 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-12-17 12:26:58,734 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:58,753 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:26:58,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:26:58,753 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:26:58,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:27:00,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:00,973 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:00,973 INFO L139 ounterexampleChecker]: Examining path program with hash -25893747, occurence #1 [2024-12-17 12:27:00,973 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:00,973 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:00,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:00,973 INFO L85 PathProgramCache]: Analyzing trace with hash 4868576, now seen corresponding path program 1 times [2024-12-17 12:27:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:00,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473989415] [2024-12-17 12:27:00,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:01,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473989415] [2024-12-17 12:27:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473989415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:01,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:27:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762594771] [2024-12-17 12:27:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:01,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:27:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:01,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:27:01,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:27:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:01,007 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:01,007 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-12-17 12:27:01,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-17 12:27:07,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:07,617 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:07,617 INFO L139 ounterexampleChecker]: Examining path program with hash -200181626, occurence #1 [2024-12-17 12:27:07,617 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:07,617 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -771597800, now seen corresponding path program 1 times [2024-12-17 12:27:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512478304] [2024-12-17 12:27:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512478304] [2024-12-17 12:27:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512478304] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:07,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:07,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:07,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348763024] [2024-12-17 12:27:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:07,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:27:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:07,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:27:07,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:27:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:07,772 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:07,772 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-12-17 12:27:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:08,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-17 12:27:08,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:08,706 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:08,707 INFO L139 ounterexampleChecker]: Examining path program with hash -1984585153, occurence #1 [2024-12-17 12:27:08,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:08,707 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:08,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash -64784942, now seen corresponding path program 2 times [2024-12-17 12:27:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:08,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404395919] [2024-12-17 12:27:08,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:27:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:08,831 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:27:08,831 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:27:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:08,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404395919] [2024-12-17 12:27:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404395919] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487508546] [2024-12-17 12:27:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:08,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:27:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:08,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:27:08,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:27:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:08,971 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:08,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:27:08,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:08,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:08,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:27:10,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-17 12:27:10,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:10,975 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:10,975 INFO L139 ounterexampleChecker]: Examining path program with hash -132460915, occurence #1 [2024-12-17 12:27:10,975 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:10,975 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:10,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -70828508, now seen corresponding path program 1 times [2024-12-17 12:27:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106533701] [2024-12-17 12:27:10,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:10,997 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:27:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:11,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:27:11,031 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:27:11,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:27:11,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:27:11,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-12-17 12:27:11,032 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:27:11,032 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:27:11,032 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-12-17 12:27:11,058 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-12-17 12:27:11,060 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:11,079 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:27:11,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:27:11,079 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:11,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:27:13,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:13,912 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:13,912 INFO L139 ounterexampleChecker]: Examining path program with hash -1986104414, occurence #1 [2024-12-17 12:27:13,912 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:13,912 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1076234331, now seen corresponding path program 1 times [2024-12-17 12:27:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688470738] [2024-12-17 12:27:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688470738] [2024-12-17 12:27:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688470738] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:27:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051481446] [2024-12-17 12:27:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:27:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:27:13,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:27:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:13,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:13,951 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-12-17 12:27:13,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:21,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-17 12:27:21,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:21,188 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:21,189 INFO L139 ounterexampleChecker]: Examining path program with hash -1973939320, occurence #1 [2024-12-17 12:27:21,189 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:21,189 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 747882726, now seen corresponding path program 1 times [2024-12-17 12:27:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769635306] [2024-12-17 12:27:21,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769635306] [2024-12-17 12:27:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769635306] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472336144] [2024-12-17 12:27:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:27:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:21,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:27:21,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:27:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:21,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:21,304 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-12-17 12:27:21,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:21,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-12-17 12:27:22,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:22,302 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:22,303 INFO L139 ounterexampleChecker]: Examining path program with hash 123225914, occurence #1 [2024-12-17 12:27:22,303 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:22,303 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -125251354, now seen corresponding path program 2 times [2024-12-17 12:27:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175203282] [2024-12-17 12:27:22,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:27:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:22,337 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:27:22,337 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:27:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175203282] [2024-12-17 12:27:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175203282] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312577351] [2024-12-17 12:27:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:27:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:22,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:27:22,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:27:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:22,483 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:27:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:27:24,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-12-17 12:27:24,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:24,706 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:24,706 INFO L139 ounterexampleChecker]: Examining path program with hash 701374568, occurence #1 [2024-12-17 12:27:24,706 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:24,706 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1505979595, now seen corresponding path program 1 times [2024-12-17 12:27:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753570186] [2024-12-17 12:27:24,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:24,730 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:27:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:24,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:27:24,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:27:24,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:27:24,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:27:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-12-17 12:27:24,771 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:27:24,772 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:27:24,772 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-12-17 12:27:24,805 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-12-17 12:27:24,807 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:24,829 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:27:24,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:27:24,830 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:24,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:27:27,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:27,774 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:27,774 INFO L139 ounterexampleChecker]: Examining path program with hash 1991777623, occurence #1 [2024-12-17 12:27:27,774 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:27,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash 943372121, now seen corresponding path program 1 times [2024-12-17 12:27:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618882664] [2024-12-17 12:27:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618882664] [2024-12-17 12:27:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618882664] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:27:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881256245] [2024-12-17 12:27:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:27:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:27,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:27:27,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:27:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:27,801 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:27,801 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-12-17 12:27:27,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-12-17 12:27:35,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:35,897 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:35,898 INFO L139 ounterexampleChecker]: Examining path program with hash -2146128677, occurence #1 [2024-12-17 12:27:35,898 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:35,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1648590199, now seen corresponding path program 1 times [2024-12-17 12:27:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237918940] [2024-12-17 12:27:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237918940] [2024-12-17 12:27:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237918940] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:36,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603498959] [2024-12-17 12:27:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:27:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:36,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:27:36,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:27:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:36,020 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:36,020 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-12-17 12:27:36,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:36,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:36,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-12-17 12:27:36,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:36,916 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:36,916 INFO L139 ounterexampleChecker]: Examining path program with hash -1822036785, occurence #1 [2024-12-17 12:27:36,916 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:36,916 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:36,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1655245659, now seen corresponding path program 2 times [2024-12-17 12:27:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65871709] [2024-12-17 12:27:36,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:27:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:36,952 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:27:36,952 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:27:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65871709] [2024-12-17 12:27:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65871709] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:37,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327660344] [2024-12-17 12:27:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:27:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:37,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:27:37,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:27:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:37,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:37,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:27:37,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:37,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:37,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:27:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-12-17 12:27:39,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:39,905 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:39,905 INFO L139 ounterexampleChecker]: Examining path program with hash 1756407911, occurence #1 [2024-12-17 12:27:39,905 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:39,905 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash -588381519, now seen corresponding path program 1 times [2024-12-17 12:27:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361427575] [2024-12-17 12:27:39,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:39,929 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:27:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:39,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:27:39,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:27:39,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:27:39,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:27:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-12-17 12:27:39,968 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:27:39,968 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:27:39,968 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-12-17 12:27:39,999 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-12-17 12:27:40,002 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:40,028 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:27:40,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:27:40,029 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:40,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:27:43,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:43,278 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:43,278 INFO L139 ounterexampleChecker]: Examining path program with hash -1764562894, occurence #1 [2024-12-17 12:27:43,278 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:43,278 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:43,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1609068039, now seen corresponding path program 1 times [2024-12-17 12:27:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290336605] [2024-12-17 12:27:43,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290336605] [2024-12-17 12:27:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290336605] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:27:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785904416] [2024-12-17 12:27:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:27:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:43,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:27:43,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:27:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:43,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:43,305 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-12-17 12:27:43,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:52,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-12-17 12:27:52,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:52,333 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:52,333 INFO L139 ounterexampleChecker]: Examining path program with hash -1318985258, occurence #1 [2024-12-17 12:27:52,333 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:52,333 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:52,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash 13686821, now seen corresponding path program 1 times [2024-12-17 12:27:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392837296] [2024-12-17 12:27:52,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:27:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392837296] [2024-12-17 12:27:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392837296] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565880228] [2024-12-17 12:27:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:52,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:27:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:52,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:27:52,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:27:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:52,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:52,467 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-12-17 12:27:52,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:52,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:53,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-12-17 12:27:53,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:53,496 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:53,496 INFO L139 ounterexampleChecker]: Examining path program with hash -1198935905, occurence #1 [2024-12-17 12:27:53,496 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:53,496 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:53,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1167395287, now seen corresponding path program 2 times [2024-12-17 12:27:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744218125] [2024-12-17 12:27:53,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:27:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:53,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:27:53,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:27:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:27:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:27:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744218125] [2024-12-17 12:27:53,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744218125] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:27:53,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:27:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:27:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279661589] [2024-12-17 12:27:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:27:53,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:27:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:27:53,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:27:53,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:27:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:53,703 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:27:53,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:27:53,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:53,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:53,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:27:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:27:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:27:56,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-12-17 12:27:56,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:27:56,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:27:56,766 INFO L139 ounterexampleChecker]: Examining path program with hash 299039306, occurence #1 [2024-12-17 12:27:56,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:27:56,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:27:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:27:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -57652873, now seen corresponding path program 1 times [2024-12-17 12:27:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:27:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828711593] [2024-12-17 12:27:56,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:27:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:27:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:56,793 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:27:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:27:56,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:27:56,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:27:56,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:27:56,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:27:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-12-17 12:27:56,831 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:27:56,831 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:27:56,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-12-17 12:27:56,866 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-12-17 12:27:56,869 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:56,893 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:27:56,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:27:56,894 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:27:56,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:28:00,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:00,485 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:00,485 INFO L139 ounterexampleChecker]: Examining path program with hash -1285395706, occurence #1 [2024-12-17 12:28:00,486 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:00,486 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:00,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -140077794, now seen corresponding path program 1 times [2024-12-17 12:28:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568260869] [2024-12-17 12:28:00,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:00,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:00,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568260869] [2024-12-17 12:28:00,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568260869] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:00,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:00,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:28:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184786472] [2024-12-17 12:28:00,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:00,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:28:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:00,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:28:00,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:28:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:00,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:00,514 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-12-17 12:28:00,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:10,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-12-17 12:28:10,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:10,414 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:10,414 INFO L139 ounterexampleChecker]: Examining path program with hash -251324216, occurence #1 [2024-12-17 12:28:10,414 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:10,414 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:10,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash -585801297, now seen corresponding path program 1 times [2024-12-17 12:28:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:10,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542488948] [2024-12-17 12:28:10,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542488948] [2024-12-17 12:28:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542488948] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486129478] [2024-12-17 12:28:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:10,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:28:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:28:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:28:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:10,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:10,552 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-12-17 12:28:10,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:10,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-12-17 12:28:11,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:11,487 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:11,487 INFO L139 ounterexampleChecker]: Examining path program with hash -1974096559, occurence #1 [2024-12-17 12:28:11,487 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:11,487 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2012583607, now seen corresponding path program 2 times [2024-12-17 12:28:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665400868] [2024-12-17 12:28:11,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:28:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:11,526 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:28:11,527 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:28:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665400868] [2024-12-17 12:28:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665400868] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293635402] [2024-12-17 12:28:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:28:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:11,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:28:11,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:28:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:11,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:11,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:28:11,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:11,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:11,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:28:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-12-17 12:28:15,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:15,264 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:15,264 INFO L139 ounterexampleChecker]: Examining path program with hash 1863153223, occurence #1 [2024-12-17 12:28:15,264 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:15,264 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:15,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -156643172, now seen corresponding path program 1 times [2024-12-17 12:28:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760258417] [2024-12-17 12:28:15,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:15,291 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:28:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:15,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:28:15,327 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:28:15,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:28:15,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:28:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-12-17 12:28:15,329 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:28:15,329 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:28:15,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-12-17 12:28:15,363 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-12-17 12:28:15,366 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:15,392 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:28:15,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:28:15,393 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:15,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:28:19,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:19,377 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:19,377 INFO L139 ounterexampleChecker]: Examining path program with hash -874168472, occurence #1 [2024-12-17 12:28:19,377 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:19,377 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1022659179, now seen corresponding path program 1 times [2024-12-17 12:28:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047155465] [2024-12-17 12:28:19,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047155465] [2024-12-17 12:28:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047155465] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:28:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774195096] [2024-12-17 12:28:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:19,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:28:19,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:19,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:28:19,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:28:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:19,406 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:19,406 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-12-17 12:28:19,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-12-17 12:28:30,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:30,245 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:30,245 INFO L139 ounterexampleChecker]: Examining path program with hash -1697647353, occurence #1 [2024-12-17 12:28:30,245 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:30,245 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:30,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1506039934, now seen corresponding path program 1 times [2024-12-17 12:28:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094373210] [2024-12-17 12:28:30,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094373210] [2024-12-17 12:28:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094373210] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904784024] [2024-12-17 12:28:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:30,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:28:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:30,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:28:30,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:28:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:30,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:30,391 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-12-17 12:28:30,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:30,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:31,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-12-17 12:28:31,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:31,369 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:31,369 INFO L139 ounterexampleChecker]: Examining path program with hash 419490358, occurence #1 [2024-12-17 12:28:31,369 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:31,369 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1140779854, now seen corresponding path program 2 times [2024-12-17 12:28:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:31,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111901070] [2024-12-17 12:28:31,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:28:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:31,411 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:28:31,412 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:28:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111901070] [2024-12-17 12:28:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111901070] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352717346] [2024-12-17 12:28:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:28:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:31,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:28:31,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:28:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:31,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:31,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:28:31,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:31,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:31,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:28:35,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-12-17 12:28:35,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:35,519 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:35,519 INFO L139 ounterexampleChecker]: Examining path program with hash 1568899054, occurence #1 [2024-12-17 12:28:35,519 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:35,519 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash 689564308, now seen corresponding path program 1 times [2024-12-17 12:28:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76371295] [2024-12-17 12:28:35,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:35,547 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:28:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:35,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:28:35,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:28:35,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:28:35,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:28:35,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-12-17 12:28:35,588 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:28:35,588 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:28:35,588 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-12-17 12:28:35,623 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-12-17 12:28:35,626 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:35,653 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:28:35,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:28:35,654 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:35,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:28:39,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:39,835 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:39,835 INFO L139 ounterexampleChecker]: Examining path program with hash -180057083, occurence #1 [2024-12-17 12:28:39,835 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:39,835 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:39,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -897877929, now seen corresponding path program 1 times [2024-12-17 12:28:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070639082] [2024-12-17 12:28:39,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070639082] [2024-12-17 12:28:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070639082] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:28:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993575215] [2024-12-17 12:28:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:28:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:39,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:28:39,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:28:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:39,999 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:39,999 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-12-17 12:28:39,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:51,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-12-17 12:28:51,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:51,761 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:51,761 INFO L139 ounterexampleChecker]: Examining path program with hash -1120424231, occurence #1 [2024-12-17 12:28:51,761 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:51,761 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:51,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1177692592, now seen corresponding path program 1 times [2024-12-17 12:28:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:51,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767162683] [2024-12-17 12:28:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:28:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767162683] [2024-12-17 12:28:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767162683] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960655178] [2024-12-17 12:28:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:51,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:28:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:51,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:28:51,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:28:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:51,916 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:51,916 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-12-17 12:28:51,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:51,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-12-17 12:28:52,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:52,888 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:52,888 INFO L139 ounterexampleChecker]: Examining path program with hash -2120851084, occurence #1 [2024-12-17 12:28:52,888 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:52,888 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:52,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 258272534, now seen corresponding path program 2 times [2024-12-17 12:28:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102227144] [2024-12-17 12:28:52,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:28:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:52,934 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:28:52,934 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:28:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:28:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:28:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102227144] [2024-12-17 12:28:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102227144] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:28:53,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:28:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:28:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897448020] [2024-12-17 12:28:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:28:53,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:28:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:28:53,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:28:53,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:28:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:53,132 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:28:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:28:53,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:53,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:53,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:28:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:28:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:28:57,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-12-17 12:28:57,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:28:57,555 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:28:57,555 INFO L139 ounterexampleChecker]: Examining path program with hash 1981444901, occurence #1 [2024-12-17 12:28:57,555 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:28:57,555 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:28:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:28:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1454588081, now seen corresponding path program 1 times [2024-12-17 12:28:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:28:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089208843] [2024-12-17 12:28:57,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:28:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:28:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:57,586 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:28:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:28:57,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:28:57,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:28:57,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:28:57,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:28:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-12-17 12:28:57,631 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:28:57,631 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:28:57,631 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-12-17 12:28:57,669 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-12-17 12:28:57,672 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:57,696 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:28:57,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:28:57,696 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:28:57,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:29:02,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:02,415 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:02,415 INFO L139 ounterexampleChecker]: Examining path program with hash -1972375489, occurence #1 [2024-12-17 12:29:02,415 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:02,415 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash 829022805, now seen corresponding path program 1 times [2024-12-17 12:29:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436558021] [2024-12-17 12:29:02,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:29:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436558021] [2024-12-17 12:29:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436558021] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:29:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332241632] [2024-12-17 12:29:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:02,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:29:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:29:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:29:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:02,448 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:02,448 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-12-17 12:29:02,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-12-17 12:29:15,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:15,291 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:15,291 INFO L139 ounterexampleChecker]: Examining path program with hash -1578122728, occurence #1 [2024-12-17 12:29:15,291 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:15,291 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1603471968, now seen corresponding path program 1 times [2024-12-17 12:29:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925705108] [2024-12-17 12:29:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:29:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925705108] [2024-12-17 12:29:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925705108] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:29:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371883723] [2024-12-17 12:29:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:29:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:15,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:29:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:29:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:15,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:15,600 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-12-17 12:29:15,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:15,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:16,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-12-17 12:29:16,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:16,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:16,818 INFO L139 ounterexampleChecker]: Examining path program with hash 1395135710, occurence #1 [2024-12-17 12:29:16,818 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:16,818 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash -656390840, now seen corresponding path program 2 times [2024-12-17 12:29:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076993488] [2024-12-17 12:29:16,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:29:16,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:16,866 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:29:16,866 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:29:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076993488] [2024-12-17 12:29:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076993488] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:17,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:29:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784042500] [2024-12-17 12:29:17,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:29:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:17,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:29:17,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:29:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:17,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:17,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:29:17,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:17,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:17,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:29:21,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-12-17 12:29:21,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:21,774 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:21,774 INFO L139 ounterexampleChecker]: Examining path program with hash 1563805974, occurence #1 [2024-12-17 12:29:21,774 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:21,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:21,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:21,775 INFO L85 PathProgramCache]: Analyzing trace with hash 37574463, now seen corresponding path program 1 times [2024-12-17 12:29:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:21,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287821224] [2024-12-17 12:29:21,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:29:21,805 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:29:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:29:21,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:29:21,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:29:21,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:29:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:29:21,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-12-17 12:29:21,853 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:29:21,853 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:29:21,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-12-17 12:29:21,894 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-12-17 12:29:21,899 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:29:21,928 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:29:21,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:29:21,929 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:29:21,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:29:27,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:27,021 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:27,022 INFO L139 ounterexampleChecker]: Examining path program with hash -30441876, occurence #1 [2024-12-17 12:29:27,022 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:27,022 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:27,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1230302868, now seen corresponding path program 1 times [2024-12-17 12:29:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168032365] [2024-12-17 12:29:27,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:29:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168032365] [2024-12-17 12:29:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168032365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:27,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:29:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862168075] [2024-12-17 12:29:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:27,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:29:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:27,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:29:27,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:29:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:27,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:27,056 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-12-17 12:29:27,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-12-17 12:29:41,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:41,247 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:41,247 INFO L139 ounterexampleChecker]: Examining path program with hash -866605406, occurence #1 [2024-12-17 12:29:41,247 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:41,247 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 313897599, now seen corresponding path program 1 times [2024-12-17 12:29:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:41,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983790982] [2024-12-17 12:29:41,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:29:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983790982] [2024-12-17 12:29:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983790982] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:29:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192940232] [2024-12-17 12:29:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:29:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:29:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:29:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:41,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:41,536 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-12-17 12:29:41,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:41,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:42,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-12-17 12:29:42,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:42,558 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:42,558 INFO L139 ounterexampleChecker]: Examining path program with hash 252259118, occurence #1 [2024-12-17 12:29:42,558 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:42,558 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:42,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1132553865, now seen corresponding path program 2 times [2024-12-17 12:29:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616024717] [2024-12-17 12:29:42,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:29:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:42,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:29:42,608 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:29:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:42,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616024717] [2024-12-17 12:29:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616024717] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:29:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245300150] [2024-12-17 12:29:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:29:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:29:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:29:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:42,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:42,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:29:42,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:42,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:42,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:29:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:29:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-12-17 12:29:48,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:48,135 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:48,135 INFO L139 ounterexampleChecker]: Examining path program with hash 192043089, occurence #1 [2024-12-17 12:29:48,135 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:48,135 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 147023866, now seen corresponding path program 1 times [2024-12-17 12:29:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112666334] [2024-12-17 12:29:48,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:29:48,168 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:29:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:29:48,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:29:48,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:29:48,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:29:48,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:29:48,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-12-17 12:29:48,218 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:29:48,219 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:29:48,219 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-12-17 12:29:48,260 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-12-17 12:29:48,263 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:29:48,292 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:29:48,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:29:48,293 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:29:48,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:29:53,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:29:53,964 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:29:53,964 INFO L139 ounterexampleChecker]: Examining path program with hash 1689945036, occurence #1 [2024-12-17 12:29:53,964 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:29:53,964 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:29:53,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:29:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1141908815, now seen corresponding path program 1 times [2024-12-17 12:29:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:29:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77119095] [2024-12-17 12:29:53,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:29:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:29:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:29:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:29:54,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:29:54,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77119095] [2024-12-17 12:29:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77119095] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:29:54,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:29:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:29:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546417431] [2024-12-17 12:29:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:29:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:29:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:29:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:29:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:29:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:29:54,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:29:54,001 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-12-17 12:29:54,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:09,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-12-17 12:30:09,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:09,438 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:09,439 INFO L139 ounterexampleChecker]: Examining path program with hash 1687306828, occurence #1 [2024-12-17 12:30:09,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:09,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1742282263, now seen corresponding path program 1 times [2024-12-17 12:30:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745790393] [2024-12-17 12:30:09,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:30:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745790393] [2024-12-17 12:30:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745790393] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:30:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463368377] [2024-12-17 12:30:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:30:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:30:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:30:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:09,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:09,622 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-12-17 12:30:09,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:09,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-12-17 12:30:10,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:10,771 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:10,771 INFO L139 ounterexampleChecker]: Examining path program with hash -2028831921, occurence #1 [2024-12-17 12:30:10,771 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:10,771 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1734163235, now seen corresponding path program 2 times [2024-12-17 12:30:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902257230] [2024-12-17 12:30:10,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:30:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:10,822 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:30:10,822 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:30:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:11,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902257230] [2024-12-17 12:30:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902257230] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:11,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:30:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174747524] [2024-12-17 12:30:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:30:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:11,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:30:11,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:30:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:11,053 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:11,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:30:11,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:11,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:11,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:30:17,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-12-17 12:30:17,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:17,017 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:17,017 INFO L139 ounterexampleChecker]: Examining path program with hash -567772300, occurence #1 [2024-12-17 12:30:17,017 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:17,017 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:17,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1572381740, now seen corresponding path program 1 times [2024-12-17 12:30:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733670899] [2024-12-17 12:30:17,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:30:17,053 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:30:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:30:17,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:30:17,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:30:17,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:30:17,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:30:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-12-17 12:30:17,110 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:30:17,110 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:30:17,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-12-17 12:30:17,152 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-12-17 12:30:17,155 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:30:17,187 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:30:17,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:30:17,187 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:30:17,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:30:23,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:23,350 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:23,350 INFO L139 ounterexampleChecker]: Examining path program with hash -1031020278, occurence #1 [2024-12-17 12:30:23,350 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:23,350 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 613153925, now seen corresponding path program 1 times [2024-12-17 12:30:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:23,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428423398] [2024-12-17 12:30:23,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:30:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428423398] [2024-12-17 12:30:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428423398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:30:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285164139] [2024-12-17 12:30:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:30:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:23,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:30:23,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:30:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:23,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:23,390 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-12-17 12:30:23,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:40,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-12-17 12:30:40,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:40,198 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:40,198 INFO L139 ounterexampleChecker]: Examining path program with hash -109394064, occurence #1 [2024-12-17 12:30:40,198 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:40,198 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:40,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2142430107, now seen corresponding path program 1 times [2024-12-17 12:30:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69491394] [2024-12-17 12:30:40,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:30:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:40,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:40,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69491394] [2024-12-17 12:30:40,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69491394] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:40,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:40,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:30:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919131786] [2024-12-17 12:30:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:40,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:30:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:40,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:30:40,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:30:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:40,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:40,390 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-12-17 12:30:40,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:40,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:41,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-12-17 12:30:41,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:41,634 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:41,635 INFO L139 ounterexampleChecker]: Examining path program with hash -1405106529, occurence #1 [2024-12-17 12:30:41,635 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:41,635 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:41,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:41,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1932907393, now seen corresponding path program 2 times [2024-12-17 12:30:41,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:41,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632647761] [2024-12-17 12:30:41,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:30:41,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:41,694 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:30:41,694 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:30:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632647761] [2024-12-17 12:30:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632647761] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:30:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174642844] [2024-12-17 12:30:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:30:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:41,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:30:41,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:41,939 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:41,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:30:41,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:41,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:41,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:30:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:30:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-12-17 12:30:48,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:48,333 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:48,333 INFO L139 ounterexampleChecker]: Examining path program with hash -761718764, occurence #1 [2024-12-17 12:30:48,333 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:48,333 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1531357064, now seen corresponding path program 1 times [2024-12-17 12:30:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450799139] [2024-12-17 12:30:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:30:48,371 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:30:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:30:48,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:30:48,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:30:48,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:30:48,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:30:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-12-17 12:30:48,432 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:30:48,432 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:30:48,432 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-12-17 12:30:48,473 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-12-17 12:30:48,476 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:30:48,510 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:30:48,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:30:48,510 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:30:48,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:30:55,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:30:55,093 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:30:55,093 INFO L139 ounterexampleChecker]: Examining path program with hash -1609431131, occurence #1 [2024-12-17 12:30:55,093 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:30:55,093 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:30:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:30:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 340318183, now seen corresponding path program 1 times [2024-12-17 12:30:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:30:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528194579] [2024-12-17 12:30:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:30:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:30:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:30:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:30:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:30:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528194579] [2024-12-17 12:30:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528194579] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:30:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:30:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:30:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314163718] [2024-12-17 12:30:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:30:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:30:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:30:55,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:30:55,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:30:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:30:55,135 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:30:55,135 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-12-17 12:30:55,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:12,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-12-17 12:31:12,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:12,988 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:12,988 INFO L139 ounterexampleChecker]: Examining path program with hash -1290223353, occurence #1 [2024-12-17 12:31:12,988 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:12,988 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 532322454, now seen corresponding path program 1 times [2024-12-17 12:31:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840541835] [2024-12-17 12:31:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:31:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:31:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:31:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:31:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840541835] [2024-12-17 12:31:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840541835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:31:13,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:31:13,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:31:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236170442] [2024-12-17 12:31:13,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:31:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:31:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:31:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:31:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:31:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:13,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:31:13,193 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-12-17 12:31:13,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:13,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-12-17 12:31:14,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:14,419 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:14,419 INFO L139 ounterexampleChecker]: Examining path program with hash 133706857, occurence #1 [2024-12-17 12:31:14,419 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:14,419 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1221158180, now seen corresponding path program 2 times [2024-12-17 12:31:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985678966] [2024-12-17 12:31:14,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:31:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:14,478 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:31:14,478 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:31:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:31:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:31:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985678966] [2024-12-17 12:31:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985678966] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:31:14,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:31:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:31:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701729418] [2024-12-17 12:31:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:31:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:31:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:31:14,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:31:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:31:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:14,732 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:31:14,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 12:31:14,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:14,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:14,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:31:21,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-12-17 12:31:21,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:21,549 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:21,549 INFO L139 ounterexampleChecker]: Examining path program with hash -322127576, occurence #1 [2024-12-17 12:31:21,549 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:21,549 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash -220311573, now seen corresponding path program 1 times [2024-12-17 12:31:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812475370] [2024-12-17 12:31:21,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:31:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:31:21,588 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:31:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:31:21,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:31:21,650 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:31:21,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:31:21,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:31:21,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-12-17 12:31:21,651 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:31:21,652 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:31:21,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-12-17 12:31:21,693 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-12-17 12:31:21,695 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:31:21,733 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:31:21,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:31:21,733 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:31:21,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:31:28,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:28,844 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:28,845 INFO L139 ounterexampleChecker]: Examining path program with hash -624693388, occurence #1 [2024-12-17 12:31:28,845 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:28,845 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:28,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 666066366, now seen corresponding path program 1 times [2024-12-17 12:31:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:28,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396728835] [2024-12-17 12:31:28,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:31:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:31:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:31:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:31:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396728835] [2024-12-17 12:31:28,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396728835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:31:28,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:31:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:31:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316058681] [2024-12-17 12:31:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:31:28,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:31:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:31:28,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:31:28,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:31:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:28,888 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:31:28,888 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-12-17 12:31:28,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:48,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-12-17 12:31:48,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:48,374 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:48,374 INFO L139 ounterexampleChecker]: Examining path program with hash -1714954588, occurence #1 [2024-12-17 12:31:48,375 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:48,375 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:48,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1637998128, now seen corresponding path program 1 times [2024-12-17 12:31:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295055180] [2024-12-17 12:31:48,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:31:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:31:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:31:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:31:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295055180] [2024-12-17 12:31:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295055180] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:31:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:31:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:31:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047925165] [2024-12-17 12:31:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:31:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:31:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:31:48,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:31:48,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:31:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:48,698 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:31:48,698 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-12-17 12:31:48,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:48,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:50,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-12-17 12:31:50,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:50,019 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:50,019 INFO L139 ounterexampleChecker]: Examining path program with hash 311893868, occurence #1 [2024-12-17 12:31:50,019 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:50,019 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:50,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1229775550, now seen corresponding path program 2 times [2024-12-17 12:31:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:50,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741792686] [2024-12-17 12:31:50,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:31:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:50,081 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:31:50,081 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:31:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:31:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:31:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741792686] [2024-12-17 12:31:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741792686] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:31:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:31:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:31:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963346900] [2024-12-17 12:31:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:31:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:31:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:31:50,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:31:50,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:31:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:50,388 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:31:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) 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-12-17 12:31:50,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:50,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:50,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:31:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:31:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:31:58,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-12-17 12:31:58,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:31:58,222 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:31:58,222 INFO L139 ounterexampleChecker]: Examining path program with hash 776712478, occurence #1 [2024-12-17 12:31:58,222 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:31:58,222 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:31:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:31:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1303082974, now seen corresponding path program 1 times [2024-12-17 12:31:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:31:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083834804] [2024-12-17 12:31:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:31:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:31:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:31:58,264 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:31:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:31:58,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:31:58,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:31:58,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:31:58,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:31:58,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-12-17 12:31:58,365 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:31:58,366 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:31:58,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-12-17 12:31:58,421 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-12-17 12:31:58,427 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:31:58,460 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:31:58,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:31:58,461 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:31:58,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:32:06,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:32:06,005 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:32:06,005 INFO L139 ounterexampleChecker]: Examining path program with hash -1766558819, occurence #1 [2024-12-17 12:32:06,005 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:32:06,005 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:32:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:32:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1416511529, now seen corresponding path program 1 times [2024-12-17 12:32:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:32:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652984107] [2024-12-17 12:32:06,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:32:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:32:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:32:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:32:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:32:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652984107] [2024-12-17 12:32:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652984107] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:32:06,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:32:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:32:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857163736] [2024-12-17 12:32:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:32:06,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:32:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:32:06,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:32:06,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:32:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:06,049 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:32:06,049 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-12-17 12:32:06,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-12-17 12:32:26,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:32:26,177 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:32:26,177 INFO L139 ounterexampleChecker]: Examining path program with hash 2017220739, occurence #1 [2024-12-17 12:32:26,177 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:32:26,177 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:32:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:32:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 292418301, now seen corresponding path program 1 times [2024-12-17 12:32:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:32:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291144654] [2024-12-17 12:32:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:32:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:32:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:32:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:32:26,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:32:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291144654] [2024-12-17 12:32:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291144654] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:32:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:32:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:32:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226568828] [2024-12-17 12:32:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:32:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:32:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:32:26,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:32:26,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:32:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:26,399 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:32:26,400 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-12-17 12:32:26,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:26,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:32:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-12-17 12:32:27,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:32:27,712 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:32:27,713 INFO L139 ounterexampleChecker]: Examining path program with hash 382240004, occurence #1 [2024-12-17 12:32:27,713 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:32:27,713 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:32:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:32:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 846026271, now seen corresponding path program 2 times [2024-12-17 12:32:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:32:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492923916] [2024-12-17 12:32:27,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:32:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:32:27,775 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:32:27,775 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:32:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:32:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:32:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492923916] [2024-12-17 12:32:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492923916] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:32:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:32:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:32:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366520822] [2024-12-17 12:32:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:32:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:32:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:32:28,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:32:28,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:32:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:28,052 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:32:28,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) 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-12-17 12:32:28,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:28,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:32:28,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:32:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:32:35,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-12-17 12:32:35,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:32:35,799 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:32:35,799 INFO L139 ounterexampleChecker]: Examining path program with hash -1168723628, occurence #1 [2024-12-17 12:32:35,799 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:32:35,799 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:32:35,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:32:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1641018540, now seen corresponding path program 1 times [2024-12-17 12:32:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:32:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967525784] [2024-12-17 12:32:35,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:32:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:32:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:32:35,840 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:32:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:32:35,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:32:35,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:32:35,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:32:35,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:32:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-12-17 12:32:35,916 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:32:35,916 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:32:35,916 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-12-17 12:32:35,964 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-12-17 12:32:35,967 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:32:36,004 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:32:36,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:32:36,006 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:32:36,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:32:44,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:32:44,241 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:32:44,241 INFO L139 ounterexampleChecker]: Examining path program with hash 662527385, occurence #1 [2024-12-17 12:32:44,241 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:32:44,241 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:32:44,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:32:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1626802361, now seen corresponding path program 1 times [2024-12-17 12:32:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:32:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609051401] [2024-12-17 12:32:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:32:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:32:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:32:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:32:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:32:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609051401] [2024-12-17 12:32:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609051401] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:32:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:32:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:32:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745451583] [2024-12-17 12:32:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:32:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:32:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:32:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:32:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:32:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:32:44,287 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:32:44,287 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-12-17 12:32:44,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-12-17 12:33:06,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:06,284 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:06,285 INFO L139 ounterexampleChecker]: Examining path program with hash 744287942, occurence #1 [2024-12-17 12:33:06,285 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:06,285 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash -692124153, now seen corresponding path program 1 times [2024-12-17 12:33:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399824890] [2024-12-17 12:33:06,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:33:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:33:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:33:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:33:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399824890] [2024-12-17 12:33:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399824890] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:33:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:33:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:33:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230535948] [2024-12-17 12:33:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:33:06,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:33:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:33:06,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:33:06,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:33:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:06,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:33:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-12-17 12:33:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:33:07,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-12-17 12:33:07,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:07,820 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:07,820 INFO L139 ounterexampleChecker]: Examining path program with hash -1587482041, occurence #1 [2024-12-17 12:33:07,820 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:07,820 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:07,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash 674369059, now seen corresponding path program 2 times [2024-12-17 12:33:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331580657] [2024-12-17 12:33:07,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:33:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:07,886 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:33:07,886 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:33:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:33:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:33:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331580657] [2024-12-17 12:33:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331580657] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:33:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:33:08,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:33:08,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563676251] [2024-12-17 12:33:08,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:33:08,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:33:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:33:08,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:33:08,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:33:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:08,187 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:33:08,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 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-12-17 12:33:08,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:08,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:33:08,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:33:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:33:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-12-17 12:33:16,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:16,903 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:16,903 INFO L139 ounterexampleChecker]: Examining path program with hash -1800607894, occurence #1 [2024-12-17 12:33:16,903 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:16,903 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 721559791, now seen corresponding path program 1 times [2024-12-17 12:33:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5441992] [2024-12-17 12:33:16,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:33:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:33:16,955 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:33:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:33:17,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:33:17,053 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:33:17,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:33:17,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:33:17,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-12-17 12:33:17,055 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:33:17,055 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:33:17,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-12-17 12:33:17,110 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-12-17 12:33:17,113 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:33:17,151 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:33:17,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:33:17,151 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:33:17,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:33:26,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:26,113 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:26,114 INFO L139 ounterexampleChecker]: Examining path program with hash -1038547835, occurence #1 [2024-12-17 12:33:26,114 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:26,114 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:26,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:26,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1982207809, now seen corresponding path program 1 times [2024-12-17 12:33:26,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:26,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908210501] [2024-12-17 12:33:26,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:33:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:33:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:33:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:33:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908210501] [2024-12-17 12:33:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908210501] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:33:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:33:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:33:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532778290] [2024-12-17 12:33:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:33:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:33:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:33:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:33:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:33:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:26,163 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:33:26,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 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-12-17 12:33:26,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-12-17 12:33:50,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:50,101 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:50,102 INFO L139 ounterexampleChecker]: Examining path program with hash -680501960, occurence #1 [2024-12-17 12:33:50,102 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:50,102 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1138713117, now seen corresponding path program 1 times [2024-12-17 12:33:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439601152] [2024-12-17 12:33:50,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:33:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:33:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:33:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:33:50,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439601152] [2024-12-17 12:33:50,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439601152] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:33:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:33:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:33:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567577160] [2024-12-17 12:33:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:33:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:33:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:33:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:33:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:33:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:50,341 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:33:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-12-17 12:33:50,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:50,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:33:51,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-12-17 12:33:51,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:33:51,716 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:33:51,717 INFO L139 ounterexampleChecker]: Examining path program with hash -915055214, occurence #1 [2024-12-17 12:33:51,717 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:33:51,717 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:33:51,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:33:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1376024247, now seen corresponding path program 2 times [2024-12-17 12:33:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:33:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518071795] [2024-12-17 12:33:51,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:33:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:33:51,783 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:33:51,783 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:33:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:33:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:33:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518071795] [2024-12-17 12:33:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518071795] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:33:52,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:33:52,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:33:52,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201456813] [2024-12-17 12:33:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:33:52,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:33:52,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:33:52,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:33:52,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:33:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:52,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:33:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 3 states have internal predecessors, (526), 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-12-17 12:33:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:33:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:33:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:34:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:34:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-12-17 12:34:01,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:01,317 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:01,318 INFO L139 ounterexampleChecker]: Examining path program with hash 652103760, occurence #1 [2024-12-17 12:34:01,318 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:01,318 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:01,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1080938993, now seen corresponding path program 1 times [2024-12-17 12:34:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066389769] [2024-12-17 12:34:01,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:34:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:34:01,364 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:34:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:34:01,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:34:01,448 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:34:01,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:34:01,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:34:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-12-17 12:34:01,450 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:34:01,450 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:34:01,450 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-12-17 12:34:01,501 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-12-17 12:34:01,505 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:34:01,544 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:34:01,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:34:01,545 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:34:01,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:34:10,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:10,616 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:10,616 INFO L139 ounterexampleChecker]: Examining path program with hash -561946306, occurence #1 [2024-12-17 12:34:10,616 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:10,616 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:10,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash -958004328, now seen corresponding path program 1 times [2024-12-17 12:34:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026502525] [2024-12-17 12:34:10,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:34:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:34:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:34:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:34:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026502525] [2024-12-17 12:34:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026502525] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:34:10,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:34:10,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:34:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153272136] [2024-12-17 12:34:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:34:10,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:34:10,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:34:10,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:34:10,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:34:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:10,666 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:34:10,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 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-12-17 12:34:10,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-12-17 12:34:35,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:35,783 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:35,783 INFO L139 ounterexampleChecker]: Examining path program with hash 1949903607, occurence #1 [2024-12-17 12:34:35,783 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:35,783 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 658162824, now seen corresponding path program 1 times [2024-12-17 12:34:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386458758] [2024-12-17 12:34:35,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:34:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:34:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:34:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:34:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386458758] [2024-12-17 12:34:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386458758] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:34:36,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:34:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:34:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752630653] [2024-12-17 12:34:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:34:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:34:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:34:36,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:34:36,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:34:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:36,033 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:34:36,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-12-17 12:34:36,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:36,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:34:37,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-12-17 12:34:37,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:37,326 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:37,326 INFO L139 ounterexampleChecker]: Examining path program with hash -1552240276, occurence #1 [2024-12-17 12:34:37,326 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:37,326 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:37,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1517029552, now seen corresponding path program 2 times [2024-12-17 12:34:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401636445] [2024-12-17 12:34:37,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:34:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:37,400 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:34:37,400 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:34:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:34:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:34:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401636445] [2024-12-17 12:34:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401636445] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:34:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:34:37,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:34:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182037301] [2024-12-17 12:34:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:34:37,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:34:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:34:37,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:34:37,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:34:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:37,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:34:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 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-12-17 12:34:37,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:37,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:34:37,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:34:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:34:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-12-17 12:34:47,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:47,928 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:47,928 INFO L139 ounterexampleChecker]: Examining path program with hash 336837478, occurence #1 [2024-12-17 12:34:47,928 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:47,928 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:47,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1835354604, now seen corresponding path program 1 times [2024-12-17 12:34:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659460432] [2024-12-17 12:34:47,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:34:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:34:47,976 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:34:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:34:48,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:34:48,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:34:48,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:34:48,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:34:48,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-12-17 12:34:48,065 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:34:48,066 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:34:48,066 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-12-17 12:34:48,120 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-12-17 12:34:48,124 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:34:48,160 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:34:48,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:34:48,160 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:34:48,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:34:58,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:34:58,056 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:34:58,056 INFO L139 ounterexampleChecker]: Examining path program with hash -1907464555, occurence #1 [2024-12-17 12:34:58,056 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:34:58,056 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:34:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:34:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1739114581, now seen corresponding path program 1 times [2024-12-17 12:34:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:34:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804534367] [2024-12-17 12:34:58,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:34:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:34:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:34:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:34:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:34:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804534367] [2024-12-17 12:34:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804534367] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:34:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:34:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:34:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681270211] [2024-12-17 12:34:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:34:58,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:34:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:34:58,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:34:58,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:34:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:34:58,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:34:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 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-12-17 12:34:58,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:24,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-12-17 12:35:24,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:35:24,306 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:35:24,306 INFO L139 ounterexampleChecker]: Examining path program with hash 1293765255, occurence #1 [2024-12-17 12:35:24,306 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:35:24,306 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:35:24,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:35:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1781334845, now seen corresponding path program 1 times [2024-12-17 12:35:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:35:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336559027] [2024-12-17 12:35:24,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:35:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:35:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:35:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:35:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:35:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336559027] [2024-12-17 12:35:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336559027] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:35:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:35:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:35:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499100106] [2024-12-17 12:35:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:35:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:35:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:35:24,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:35:24,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:35:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:24,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:35:24,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-12-17 12:35:24,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:24,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:35:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-12-17 12:35:25,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:35:25,745 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:35:25,745 INFO L139 ounterexampleChecker]: Examining path program with hash 1816776693, occurence #1 [2024-12-17 12:35:25,745 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:35:25,745 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:35:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:35:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 566706233, now seen corresponding path program 2 times [2024-12-17 12:35:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:35:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7597817] [2024-12-17 12:35:25,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:35:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:35:25,818 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:35:25,819 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:35:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:35:26,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:35:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7597817] [2024-12-17 12:35:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7597817] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:35:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:35:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:35:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821719263] [2024-12-17 12:35:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:35:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:35:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:35:26,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:35:26,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:35:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:26,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:35:26,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 3 states have internal predecessors, (562), 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-12-17 12:35:26,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:26,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:35:26,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:35:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:35:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-12-17 12:35:37,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:35:37,132 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:35:37,132 INFO L139 ounterexampleChecker]: Examining path program with hash -45229614, occurence #1 [2024-12-17 12:35:37,132 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:35:37,132 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:35:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:35:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1365807674, now seen corresponding path program 1 times [2024-12-17 12:35:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:35:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381067094] [2024-12-17 12:35:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:35:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:35:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:35:37,187 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:35:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:35:37,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:35:37,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:35:37,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:35:37,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:35:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-12-17 12:35:37,286 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:35:37,286 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:35:37,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-12-17 12:35:37,340 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-12-17 12:35:37,344 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:35:37,381 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:35:37,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:35:37,382 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:35:37,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:35:47,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:35:47,895 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:35:47,896 INFO L139 ounterexampleChecker]: Examining path program with hash 149051749, occurence #1 [2024-12-17 12:35:47,896 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:35:47,896 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:35:47,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:35:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash -664121399, now seen corresponding path program 1 times [2024-12-17 12:35:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:35:47,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914827000] [2024-12-17 12:35:47,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:35:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:35:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:35:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:35:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:35:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914827000] [2024-12-17 12:35:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914827000] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:35:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:35:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:35:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995790980] [2024-12-17 12:35:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:35:47,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:35:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:35:47,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:35:47,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:35:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:35:47,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:35:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 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-12-17 12:35:47,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:16,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-12-17 12:36:16,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:36:16,014 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:36:16,015 INFO L139 ounterexampleChecker]: Examining path program with hash -845619602, occurence #1 [2024-12-17 12:36:16,015 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:36:16,015 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:36:16,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:36:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash -567351176, now seen corresponding path program 1 times [2024-12-17 12:36:16,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:36:16,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937345334] [2024-12-17 12:36:16,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:36:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:36:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:36:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:36:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:36:16,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937345334] [2024-12-17 12:36:16,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937345334] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:36:16,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:36:16,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:36:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454541052] [2024-12-17 12:36:16,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:36:16,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:36:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:36:16,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:36:16,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:36:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:16,306 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:36:16,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-12-17 12:36:16,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:16,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:36:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-12-17 12:36:17,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:36:17,518 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:36:17,518 INFO L139 ounterexampleChecker]: Examining path program with hash 1005942896, occurence #1 [2024-12-17 12:36:17,518 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:36:17,518 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:36:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:36:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash -958821172, now seen corresponding path program 2 times [2024-12-17 12:36:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:36:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532469041] [2024-12-17 12:36:17,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:36:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:36:17,594 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:36:17,594 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:36:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:36:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:36:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532469041] [2024-12-17 12:36:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532469041] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:36:18,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:36:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:36:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76172552] [2024-12-17 12:36:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:36:18,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:36:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:36:18,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:36:18,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:36:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:18,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:36:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 3 states have internal predecessors, (580), 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-12-17 12:36:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:36:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:36:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:36:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-12-17 12:36:29,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:36:29,705 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:36:29,705 INFO L139 ounterexampleChecker]: Examining path program with hash 310437964, occurence #1 [2024-12-17 12:36:29,705 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:36:29,705 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:36:29,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:36:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2009043685, now seen corresponding path program 1 times [2024-12-17 12:36:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:36:29,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431425207] [2024-12-17 12:36:29,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:36:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:36:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:36:29,757 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:36:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:36:29,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:36:29,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:36:29,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:36:29,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:36:29,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-12-17 12:36:29,863 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:36:29,863 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:36:29,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-12-17 12:36:29,911 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-12-17 12:36:29,914 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:36:29,948 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:36:29,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:36:29,949 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:36:29,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:36:40,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:36:40,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:36:40,636 INFO L139 ounterexampleChecker]: Examining path program with hash -950144751, occurence #1 [2024-12-17 12:36:40,636 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:36:40,636 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:36:40,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:36:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 901423817, now seen corresponding path program 1 times [2024-12-17 12:36:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:36:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689676394] [2024-12-17 12:36:40,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:36:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:36:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:36:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:36:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:36:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689676394] [2024-12-17 12:36:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689676394] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:36:40,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:36:40,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:36:40,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013836473] [2024-12-17 12:36:40,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:36:40,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:36:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:36:40,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:36:40,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:36:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:36:40,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:36:40,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 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-12-17 12:36:40,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:10,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-12-17 12:37:10,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:37:10,504 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:37:10,505 INFO L139 ounterexampleChecker]: Examining path program with hash 1217697938, occurence #1 [2024-12-17 12:37:10,505 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:37:10,505 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:37:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:37:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash -4354038, now seen corresponding path program 1 times [2024-12-17 12:37:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:37:10,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096880418] [2024-12-17 12:37:10,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:37:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:37:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:37:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:37:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:37:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096880418] [2024-12-17 12:37:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096880418] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:37:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:37:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:37:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547579699] [2024-12-17 12:37:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:37:10,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:37:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:37:10,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:37:10,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:37:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:10,787 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:37:10,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-12-17 12:37:10,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:10,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:37:12,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-12-17 12:37:12,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:37:12,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:37:12,029 INFO L139 ounterexampleChecker]: Examining path program with hash 650994589, occurence #1 [2024-12-17 12:37:12,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:37:12,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:37:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:37:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1457319804, now seen corresponding path program 2 times [2024-12-17 12:37:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:37:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919450821] [2024-12-17 12:37:12,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:37:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:37:12,107 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:37:12,107 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:37:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:37:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:37:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919450821] [2024-12-17 12:37:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919450821] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:37:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:37:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:37:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715134069] [2024-12-17 12:37:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:37:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:37:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:37:12,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:37:12,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:37:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:12,538 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:37:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 3 states have internal predecessors, (598), 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-12-17 12:37:12,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:12,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:37:12,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:37:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:37:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-12-17 12:37:24,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:37:24,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:37:24,636 INFO L139 ounterexampleChecker]: Examining path program with hash 2059690071, occurence #1 [2024-12-17 12:37:24,636 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:37:24,636 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:37:24,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:37:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash -358717014, now seen corresponding path program 1 times [2024-12-17 12:37:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:37:24,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226176136] [2024-12-17 12:37:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:37:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:37:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:37:24,690 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:37:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:37:24,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:37:24,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:37:24,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:37:24,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:37:24,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-12-17 12:37:24,802 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:37:24,802 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:37:24,802 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-12-17 12:37:24,857 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-12-17 12:37:24,861 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:37:24,897 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:37:24,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:37:24,897 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:37:24,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 12:37:36,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:37:36,699 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:37:36,699 INFO L139 ounterexampleChecker]: Examining path program with hash -951782293, occurence #1 [2024-12-17 12:37:36,699 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:37:36,699 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:37:36,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:37:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash -329744022, now seen corresponding path program 1 times [2024-12-17 12:37:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:37:36,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551754120] [2024-12-17 12:37:36,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:37:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:37:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:37:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:37:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:37:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551754120] [2024-12-17 12:37:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551754120] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:37:36,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:37:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 12:37:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738666767] [2024-12-17 12:37:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:37:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 12:37:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:37:36,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 12:37:36,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 12:37:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:37:36,826 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:37:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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-12-17 12:37:36,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-12-17 12:38:08,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:38:08,242 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:38:08,243 INFO L139 ounterexampleChecker]: Examining path program with hash -1467983824, occurence #1 [2024-12-17 12:38:08,243 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:38:08,243 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:38:08,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:38:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 681654229, now seen corresponding path program 1 times [2024-12-17 12:38:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:38:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770643895] [2024-12-17 12:38:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:38:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:38:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 12:38:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:38:08,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:38:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770643895] [2024-12-17 12:38:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770643895] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:38:08,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:38:08,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:38:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115412661] [2024-12-17 12:38:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:38:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 12:38:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:38:08,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 12:38:08,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 12:38:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:08,630 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:38:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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-12-17 12:38:08,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:08,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:38:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-12-17 12:38:10,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:38:10,429 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:38:10,430 INFO L139 ounterexampleChecker]: Examining path program with hash -2008935220, occurence #1 [2024-12-17 12:38:10,430 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:38:10,430 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:38:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:38:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1856324195, now seen corresponding path program 2 times [2024-12-17 12:38:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:38:10,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991445751] [2024-12-17 12:38:10,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 12:38:10,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:38:10,528 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 12:38:10,528 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 12:38:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 12:38:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 12:38:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991445751] [2024-12-17 12:38:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991445751] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 12:38:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 12:38:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 12:38:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067439352] [2024-12-17 12:38:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 12:38:11,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-17 12:38:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 12:38:11,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-17 12:38:11,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-17 12:38:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:11,099 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 12:38:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 3 states have internal predecessors, (616), 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-12-17 12:38:11,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:11,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:38:11,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 12:38:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 12:38:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-17 12:38:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-12-17 12:38:23,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 12:38:23,605 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 12:38:23,605 INFO L139 ounterexampleChecker]: Examining path program with hash -302591956, occurence #1 [2024-12-17 12:38:23,605 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 12:38:23,605 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 12:38:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 12:38:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 375702972, now seen corresponding path program 1 times [2024-12-17 12:38:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 12:38:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690209657] [2024-12-17 12:38:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 12:38:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 12:38:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:38:23,661 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 12:38:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 12:38:23,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 12:38:23,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 12:38:23,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 12:38:23,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 12:38:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-12-17 12:38:23,864 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-17 12:38:23,864 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 12:38:23,864 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-12-17 12:38:23,931 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-12-17 12:38:23,934 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:38:24,007 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 12:38:24,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 12:38:24,008 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;@1c15ebd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 12:38:24,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. Killed by 15