./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX --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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 08:08:59,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 08:08:59,508 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-05 08:08:59,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 08:08:59,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-05 08:08:59,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 08:08:59,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-05 08:08:59,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-05 08:08:59,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 08:08:59,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-05 08:08:59,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * Use SBE=true [2024-12-05 08:08:59,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 08:08:59,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 08:08:59,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-05 08:08:59,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:08:59,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-05 08:08:59,536 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-05 08:08:59,536 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2024-12-05 08:08:59,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 08:08:59,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 08:08:59,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 08:08:59,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 08:08:59,793 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 08:08:59,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-12-05 08:09:02,400 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/data/4c384cd60/f43e4a741874408caecd84770dd2e90d/FLAG9ecc3183f [2024-12-05 08:09:02,653 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 08:09:02,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-12-05 08:09:02,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/data/4c384cd60/f43e4a741874408caecd84770dd2e90d/FLAG9ecc3183f [2024-12-05 08:09:02,979 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/data/4c384cd60/f43e4a741874408caecd84770dd2e90d [2024-12-05 08:09:02,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 08:09:02,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 08:09:02,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 08:09:02,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 08:09:02,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 08:09:02,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:09:02" (1/1) ... [2024-12-05 08:09:02,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5490136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:02, skipping insertion in model container [2024-12-05 08:09:02,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:09:02" (1/1) ... [2024-12-05 08:09:03,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 08:09:03,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2024-12-05 08:09:03,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:09:03,408 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 08:09:03,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2024-12-05 08:09:03,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:09:03,500 INFO L204 MainTranslator]: Completed translation [2024-12-05 08:09:03,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03 WrapperNode [2024-12-05 08:09:03,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 08:09:03,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 08:09:03,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 08:09:03,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 08:09:03,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,540 INFO L138 Inliner]: procedures = 271, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 139 [2024-12-05 08:09:03,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 08:09:03,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 08:09:03,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 08:09:03,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 08:09:03,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 08:09:03,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 08:09:03,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 08:09:03,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 08:09:03,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (1/1) ... [2024-12-05 08:09:03,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:09:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:09:03,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-05 08:09:03,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 08:09:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-05 08:09:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-05 08:09:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 08:09:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 08:09:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 08:09:03,618 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-05 08:09:03,722 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 08:09:03,723 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 08:09:03,937 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-05 08:09:03,937 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 08:09:04,181 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 08:09:04,181 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-12-05 08:09:04,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:09:04 BoogieIcfgContainer [2024-12-05 08:09:04,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 08:09:04,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-05 08:09:04,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-05 08:09:04,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-05 08:09:04,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:09:02" (1/3) ... [2024-12-05 08:09:04,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:09:04, skipping insertion in model container [2024-12-05 08:09:04,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:09:03" (2/3) ... [2024-12-05 08:09:04,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:09:04, skipping insertion in model container [2024-12-05 08:09:04,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:09:04" (3/3) ... [2024-12-05 08:09:04,191 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-12-05 08:09:04,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-05 08:09:04,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-12-05 08:09:04,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-05 08:09:04,248 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-05 08:09:04,297 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:04,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-05 08:09:04,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:09:04,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-05 08:09:04,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf66efbf-5c99-4c16-97cc-6b4715628994/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-05 08:09:04,375 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:04,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:04,399 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:04,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:04,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:04,541 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:04,541 INFO L139 ounterexampleChecker]: Examining path program with hash -49702520, occurence #1 [2024-12-05 08:09:04,541 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:04,541 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:04,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -472337074, now seen corresponding path program 1 times [2024-12-05 08:09:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285542176] [2024-12-05 08:09:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:04,793 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-05 08:09:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285542176] [2024-12-05 08:09:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285542176] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374560568] [2024-12-05 08:09:04,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:04,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:04,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:04,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:04,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:04,822 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-05 08:09:04,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:04,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-05 08:09:04,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:04,905 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:04,905 INFO L139 ounterexampleChecker]: Examining path program with hash -2018140633, occurence #1 [2024-12-05 08:09:04,905 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:04,906 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash -366971700, now seen corresponding path program 1 times [2024-12-05 08:09:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577771570] [2024-12-05 08:09:04,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:04,959 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:04,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:04,998 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:05,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:05,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:05,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-05 08:09:05,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-05 08:09:05,009 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:05,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-05 08:09:05,031 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-05 08:09:05,034 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:05,040 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:05,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:05,041 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:05,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:05,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:05,244 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:05,244 INFO L139 ounterexampleChecker]: Examining path program with hash -857269520, occurence #1 [2024-12-05 08:09:05,244 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:05,244 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1971145828, now seen corresponding path program 1 times [2024-12-05 08:09:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436493022] [2024-12-05 08:09:05,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:05,325 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-05 08:09:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436493022] [2024-12-05 08:09:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436493022] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055614606] [2024-12-05 08:09:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:05,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:05,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:05,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:05,326 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-05 08:09:05,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:05,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-05 08:09:05,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:05,691 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:05,691 INFO L139 ounterexampleChecker]: Examining path program with hash 728217237, occurence #1 [2024-12-05 08:09:05,691 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:05,691 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash 682820780, now seen corresponding path program 1 times [2024-12-05 08:09:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640947895] [2024-12-05 08:09:05,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:05,879 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-05 08:09:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640947895] [2024-12-05 08:09:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640947895] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:05,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:05,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608377842] [2024-12-05 08:09:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:05,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:05,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:05,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:05,881 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:05,881 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-05 08:09:05,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:05,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:06,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-05 08:09:06,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:06,016 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:06,016 INFO L139 ounterexampleChecker]: Examining path program with hash 1856763371, occurence #1 [2024-12-05 08:09:06,016 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:06,016 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1372423479, now seen corresponding path program 1 times [2024-12-05 08:09:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733106174] [2024-12-05 08:09:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:06,306 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-05 08:09:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733106174] [2024-12-05 08:09:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733106174] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:06,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629545335] [2024-12-05 08:09:06,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:06,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:06,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,308 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:06,308 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-05 08:09:06,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:06,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-05 08:09:06,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:06,402 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:06,402 INFO L139 ounterexampleChecker]: Examining path program with hash 2087367909, occurence #1 [2024-12-05 08:09:06,402 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:06,402 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -713656586, now seen corresponding path program 1 times [2024-12-05 08:09:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848092883] [2024-12-05 08:09:06,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:06,458 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:06,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:06,486 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:06,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:06,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-05 08:09:06,488 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:06,488 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:06,488 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-05 08:09:06,518 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-05 08:09:06,521 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:06,529 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:06,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:06,530 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:06,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:06,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:06,905 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:06,906 INFO L139 ounterexampleChecker]: Examining path program with hash 96388523, occurence #1 [2024-12-05 08:09:06,906 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:06,906 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 957465559, now seen corresponding path program 1 times [2024-12-05 08:09:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461604468] [2024-12-05 08:09:06,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:06,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-05 08:09:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461604468] [2024-12-05 08:09:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461604468] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897014960] [2024-12-05 08:09:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:06,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:06,972 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:06,972 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-05 08:09:06,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-05 08:09:07,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:07,796 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:07,796 INFO L139 ounterexampleChecker]: Examining path program with hash -159545385, occurence #1 [2024-12-05 08:09:07,797 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:07,797 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1046196247, now seen corresponding path program 1 times [2024-12-05 08:09:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560158644] [2024-12-05 08:09:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:07,931 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-05 08:09:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560158644] [2024-12-05 08:09:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560158644] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752312418] [2024-12-05 08:09:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:07,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:07,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:07,932 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:07,932 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-05 08:09:07,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:07,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-05 08:09:08,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:08,096 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:08,096 INFO L139 ounterexampleChecker]: Examining path program with hash 117237244, occurence #1 [2024-12-05 08:09:08,096 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:08,096 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1553748314, now seen corresponding path program 1 times [2024-12-05 08:09:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172344205] [2024-12-05 08:09:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:08,309 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-05 08:09:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172344205] [2024-12-05 08:09:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172344205] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108898356] [2024-12-05 08:09:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:08,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:08,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:08,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,311 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:08,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:08,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-05 08:09:08,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:08,506 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:08,507 INFO L139 ounterexampleChecker]: Examining path program with hash 912027006, occurence #1 [2024-12-05 08:09:08,507 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:08,507 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:08,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash -107457601, now seen corresponding path program 1 times [2024-12-05 08:09:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:08,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604333829] [2024-12-05 08:09:08,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:08,546 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:08,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:08,570 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:08,570 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:08,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:08,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-05 08:09:08,571 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:08,571 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:08,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-05 08:09:08,593 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-05 08:09:08,595 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:08,604 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:08,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:08,605 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:08,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:09,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:09,011 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:09,011 INFO L139 ounterexampleChecker]: Examining path program with hash 801533062, occurence #1 [2024-12-05 08:09:09,011 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:09,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1827686070, now seen corresponding path program 1 times [2024-12-05 08:09:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648707865] [2024-12-05 08:09:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:09,062 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-05 08:09:09,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:09,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648707865] [2024-12-05 08:09:09,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648707865] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:09,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:09,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:09,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175665336] [2024-12-05 08:09:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:09,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:09,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:09,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:09,063 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:09,063 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-05 08:09:09,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-05 08:09:10,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:10,265 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:10,265 INFO L139 ounterexampleChecker]: Examining path program with hash -478936895, occurence #1 [2024-12-05 08:09:10,265 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:10,265 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:10,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1642732025, now seen corresponding path program 1 times [2024-12-05 08:09:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:10,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720999069] [2024-12-05 08:09:10,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:10,419 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-05 08:09:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720999069] [2024-12-05 08:09:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720999069] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646406116] [2024-12-05 08:09:10,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:10,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:10,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:10,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,421 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:10,421 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-05 08:09:10,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:10,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-05 08:09:10,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:10,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:10,625 INFO L139 ounterexampleChecker]: Examining path program with hash -154234235, occurence #1 [2024-12-05 08:09:10,625 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:10,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:10,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 974742749, now seen corresponding path program 1 times [2024-12-05 08:09:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900759001] [2024-12-05 08:09:10,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:10,860 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-05 08:09:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900759001] [2024-12-05 08:09:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900759001] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820218020] [2024-12-05 08:09:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:10,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:09:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:10,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:09:10,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:09:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:10,861 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-05 08:09:10,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:10,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:10,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-05 08:09:11,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:11,052 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:11,052 INFO L139 ounterexampleChecker]: Examining path program with hash 1805275121, occurence #1 [2024-12-05 08:09:11,053 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:11,053 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash -721545480, now seen corresponding path program 1 times [2024-12-05 08:09:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356583621] [2024-12-05 08:09:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:11,090 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:11,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:11,115 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:11,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:11,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-05 08:09:11,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:11,117 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:11,117 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-05 08:09:11,143 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-05 08:09:11,145 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:11,156 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:11,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:11,157 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:11,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:11,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:11,775 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:11,775 INFO L139 ounterexampleChecker]: Examining path program with hash -1404758279, occurence #1 [2024-12-05 08:09:11,775 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:11,775 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1111797400, now seen corresponding path program 1 times [2024-12-05 08:09:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723172810] [2024-12-05 08:09:11,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:11,815 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-05 08:09:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723172810] [2024-12-05 08:09:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723172810] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887677018] [2024-12-05 08:09:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:11,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:11,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:11,816 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:11,816 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-05 08:09:11,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-05 08:09:13,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:13,285 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:13,286 INFO L139 ounterexampleChecker]: Examining path program with hash 1833009674, occurence #1 [2024-12-05 08:09:13,286 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:13,286 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1014852312, now seen corresponding path program 1 times [2024-12-05 08:09:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:13,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583917049] [2024-12-05 08:09:13,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:13,415 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-05 08:09:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583917049] [2024-12-05 08:09:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583917049] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365476123] [2024-12-05 08:09:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:13,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:13,417 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-05 08:09:13,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:13,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-05 08:09:13,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:13,726 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:13,727 INFO L139 ounterexampleChecker]: Examining path program with hash -1808281354, occurence #1 [2024-12-05 08:09:13,727 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:13,727 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:13,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -260136753, now seen corresponding path program 1 times [2024-12-05 08:09:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:13,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858714139] [2024-12-05 08:09:13,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:13,965 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-05 08:09:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858714139] [2024-12-05 08:09:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858714139] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352265518] [2024-12-05 08:09:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:13,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:13,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:13,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,966 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:13,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:13,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:13,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-05 08:09:14,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:14,300 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:14,300 INFO L139 ounterexampleChecker]: Examining path program with hash -1612700587, occurence #1 [2024-12-05 08:09:14,300 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:14,300 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1626351726, now seen corresponding path program 1 times [2024-12-05 08:09:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483302170] [2024-12-05 08:09:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:14,329 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:14,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:14,353 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:14,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:14,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:14,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-05 08:09:14,355 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:14,355 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:14,355 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-05 08:09:14,379 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-05 08:09:14,382 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:14,394 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:14,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:14,395 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:14,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:15,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:15,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:15,028 INFO L139 ounterexampleChecker]: Examining path program with hash 1641807651, occurence #1 [2024-12-05 08:09:15,028 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:15,028 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:15,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1565699304, now seen corresponding path program 1 times [2024-12-05 08:09:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819748683] [2024-12-05 08:09:15,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:15,056 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-05 08:09:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819748683] [2024-12-05 08:09:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819748683] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:15,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874937394] [2024-12-05 08:09:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:15,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:15,057 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:15,057 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-05 08:09:15,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-05 08:09:17,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:17,076 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:17,076 INFO L139 ounterexampleChecker]: Examining path program with hash -88160030, occurence #1 [2024-12-05 08:09:17,076 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:17,076 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2108344585, now seen corresponding path program 1 times [2024-12-05 08:09:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87427723] [2024-12-05 08:09:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:17,223 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-05 08:09:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87427723] [2024-12-05 08:09:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87427723] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874521348] [2024-12-05 08:09:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:17,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,225 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:17,225 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-05 08:09:17,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:17,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-05 08:09:17,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:17,629 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:17,629 INFO L139 ounterexampleChecker]: Examining path program with hash 1597238894, occurence #1 [2024-12-05 08:09:17,630 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:17,630 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash -858847731, now seen corresponding path program 1 times [2024-12-05 08:09:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301539216] [2024-12-05 08:09:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:17,861 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-05 08:09:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301539216] [2024-12-05 08:09:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301539216] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480539279] [2024-12-05 08:09:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:17,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:17,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:17,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,863 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:17,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:18,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-05 08:09:18,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:18,369 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:18,369 INFO L139 ounterexampleChecker]: Examining path program with hash 1779004322, occurence #1 [2024-12-05 08:09:18,369 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:18,369 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:18,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1973459480, now seen corresponding path program 1 times [2024-12-05 08:09:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576623919] [2024-12-05 08:09:18,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:18,408 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:18,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:18,435 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:18,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:18,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-05 08:09:18,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:18,437 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:18,437 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-12-05 08:09:18,463 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-12-05 08:09:18,465 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:18,478 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:18,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:18,479 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:18,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:19,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:19,383 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:19,383 INFO L139 ounterexampleChecker]: Examining path program with hash -316530663, occurence #1 [2024-12-05 08:09:19,383 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:19,383 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:19,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash -613740523, now seen corresponding path program 1 times [2024-12-05 08:09:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838963226] [2024-12-05 08:09:19,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:19,422 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-05 08:09:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838963226] [2024-12-05 08:09:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838963226] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:19,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:19,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702179414] [2024-12-05 08:09:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:19,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:19,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:19,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:19,423 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:19,423 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-05 08:09:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-05 08:09:22,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:22,024 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:22,024 INFO L139 ounterexampleChecker]: Examining path program with hash -2139352819, occurence #1 [2024-12-05 08:09:22,025 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:22,025 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:22,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1037065259, now seen corresponding path program 1 times [2024-12-05 08:09:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841100789] [2024-12-05 08:09:22,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:22,151 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-05 08:09:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841100789] [2024-12-05 08:09:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841100789] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684679885] [2024-12-05 08:09:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:22,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:22,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:22,153 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-05 08:09:22,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:22,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-05 08:09:22,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:22,638 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:22,638 INFO L139 ounterexampleChecker]: Examining path program with hash -306502240, occurence #1 [2024-12-05 08:09:22,638 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:22,638 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:22,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2034258974, now seen corresponding path program 1 times [2024-12-05 08:09:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785113398] [2024-12-05 08:09:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:22,850 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-05 08:09:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785113398] [2024-12-05 08:09:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785113398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132897310] [2024-12-05 08:09:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:22,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:22,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:22,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:22,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-05 08:09:23,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:23,422 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:23,423 INFO L139 ounterexampleChecker]: Examining path program with hash -1613306388, occurence #1 [2024-12-05 08:09:23,423 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:23,423 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1275114204, now seen corresponding path program 1 times [2024-12-05 08:09:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077286231] [2024-12-05 08:09:23,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:23,450 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:23,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:23,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:23,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:23,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-05 08:09:23,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:23,473 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:23,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-12-05 08:09:23,501 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-05 08:09:23,504 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:23,519 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:23,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:23,520 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:23,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:24,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:24,651 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:24,651 INFO L139 ounterexampleChecker]: Examining path program with hash -1881672886, occurence #1 [2024-12-05 08:09:24,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:24,651 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash -314257302, now seen corresponding path program 1 times [2024-12-05 08:09:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712948587] [2024-12-05 08:09:24,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:24,686 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-05 08:09:24,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:24,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712948587] [2024-12-05 08:09:24,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712948587] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:24,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:24,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282329330] [2024-12-05 08:09:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:24,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:24,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:24,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:24,687 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-05 08:09:24,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:27,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-05 08:09:27,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:27,865 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:27,865 INFO L139 ounterexampleChecker]: Examining path program with hash -1143551678, occurence #1 [2024-12-05 08:09:27,865 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:27,865 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1399817403, now seen corresponding path program 1 times [2024-12-05 08:09:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461497727] [2024-12-05 08:09:27,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:28,037 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-05 08:09:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461497727] [2024-12-05 08:09:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461497727] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893408526] [2024-12-05 08:09:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:28,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:28,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:28,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:28,039 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-05 08:09:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:28,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-05 08:09:28,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:28,561 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:28,561 INFO L139 ounterexampleChecker]: Examining path program with hash -1604693528, occurence #1 [2024-12-05 08:09:28,561 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:28,561 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:28,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash 612390896, now seen corresponding path program 1 times [2024-12-05 08:09:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:28,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571212650] [2024-12-05 08:09:28,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:28,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:28,785 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-05 08:09:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571212650] [2024-12-05 08:09:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571212650] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138581329] [2024-12-05 08:09:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:28,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:28,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:28,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,786 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:28,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:28,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:28,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:28,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-05 08:09:29,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:29,489 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:29,489 INFO L139 ounterexampleChecker]: Examining path program with hash -1294894078, occurence #1 [2024-12-05 08:09:29,490 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:29,490 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1313713249, now seen corresponding path program 1 times [2024-12-05 08:09:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028119099] [2024-12-05 08:09:29,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:29,531 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:29,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:29,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:29,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:29,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:29,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-05 08:09:29,564 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:29,565 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:29,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-12-05 08:09:29,595 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-12-05 08:09:29,597 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:29,609 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:29,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:29,609 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:29,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:30,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:30,939 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:30,939 INFO L139 ounterexampleChecker]: Examining path program with hash -1719706789, occurence #1 [2024-12-05 08:09:30,939 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:30,939 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:30,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2045450322, now seen corresponding path program 1 times [2024-12-05 08:09:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965494715] [2024-12-05 08:09:30,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:30,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-05 08:09:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965494715] [2024-12-05 08:09:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965494715] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:30,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715943294] [2024-12-05 08:09:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:30,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:30,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:30,971 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:30,971 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-05 08:09:30,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-05 08:09:34,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:34,568 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:34,568 INFO L139 ounterexampleChecker]: Examining path program with hash 1046316591, occurence #1 [2024-12-05 08:09:34,568 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:34,568 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:34,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 217374966, now seen corresponding path program 1 times [2024-12-05 08:09:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452195478] [2024-12-05 08:09:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:34,727 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-05 08:09:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452195478] [2024-12-05 08:09:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452195478] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:34,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455151505] [2024-12-05 08:09:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:34,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:34,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:34,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:34,728 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:34,728 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-05 08:09:34,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:34,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-05 08:09:35,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:35,349 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:35,349 INFO L139 ounterexampleChecker]: Examining path program with hash -699268435, occurence #1 [2024-12-05 08:09:35,349 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:35,349 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:35,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2107909891, now seen corresponding path program 1 times [2024-12-05 08:09:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476374651] [2024-12-05 08:09:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:35,532 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-05 08:09:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476374651] [2024-12-05 08:09:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476374651] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342755241] [2024-12-05 08:09:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:35,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:35,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:35,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:35,533 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:35,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:35,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:35,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:35,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:36,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-05 08:09:36,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:36,554 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:36,554 INFO L139 ounterexampleChecker]: Examining path program with hash -76411144, occurence #1 [2024-12-05 08:09:36,554 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:36,554 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:36,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -721909458, now seen corresponding path program 1 times [2024-12-05 08:09:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362095843] [2024-12-05 08:09:36,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:36,583 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:36,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:36,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:36,604 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:36,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:36,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-05 08:09:36,605 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:36,606 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:36,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-12-05 08:09:36,632 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-12-05 08:09:36,634 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:36,648 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:36,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:36,648 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:36,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:38,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:38,144 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:38,144 INFO L139 ounterexampleChecker]: Examining path program with hash -1099008155, occurence #1 [2024-12-05 08:09:38,144 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:38,144 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:38,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1628536182, now seen corresponding path program 1 times [2024-12-05 08:09:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571089954] [2024-12-05 08:09:38,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:38,174 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-05 08:09:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571089954] [2024-12-05 08:09:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571089954] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682329406] [2024-12-05 08:09:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:38,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:38,175 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:38,175 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-05 08:09:38,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:42,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-05 08:09:42,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:42,537 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:42,537 INFO L139 ounterexampleChecker]: Examining path program with hash -585354224, occurence #1 [2024-12-05 08:09:42,537 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:42,537 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -573941647, now seen corresponding path program 1 times [2024-12-05 08:09:42,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:42,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47726314] [2024-12-05 08:09:42,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:42,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:42,766 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-05 08:09:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47726314] [2024-12-05 08:09:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47726314] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306774998] [2024-12-05 08:09:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:42,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:42,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:42,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:42,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:42,768 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-05 08:09:42,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:42,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:43,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-05 08:09:43,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:43,629 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:43,629 INFO L139 ounterexampleChecker]: Examining path program with hash -262201280, occurence #1 [2024-12-05 08:09:43,629 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:43,629 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -241020993, now seen corresponding path program 1 times [2024-12-05 08:09:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764552599] [2024-12-05 08:09:43,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:43,846 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-05 08:09:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:43,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764552599] [2024-12-05 08:09:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764552599] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:43,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:43,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083816994] [2024-12-05 08:09:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:43,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:43,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:43,848 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:43,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:43,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:43,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:43,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:45,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-05 08:09:45,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:45,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:45,081 INFO L139 ounterexampleChecker]: Examining path program with hash -1551180438, occurence #1 [2024-12-05 08:09:45,082 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:45,082 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:45,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1993992623, now seen corresponding path program 1 times [2024-12-05 08:09:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556461703] [2024-12-05 08:09:45,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:45,114 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:45,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:45,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:45,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:45,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:45,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-05 08:09:45,140 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:45,140 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:45,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-12-05 08:09:45,170 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-12-05 08:09:45,172 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:45,188 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:45,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:45,189 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:45,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:46,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:46,954 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:46,954 INFO L139 ounterexampleChecker]: Examining path program with hash 510086499, occurence #1 [2024-12-05 08:09:46,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:46,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:46,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 405327939, now seen corresponding path program 1 times [2024-12-05 08:09:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379231520] [2024-12-05 08:09:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:46,987 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-05 08:09:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379231520] [2024-12-05 08:09:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379231520] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254926463] [2024-12-05 08:09:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:46,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:46,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:46,988 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:46,989 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-05 08:09:46,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-05 08:09:52,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:52,218 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:52,218 INFO L139 ounterexampleChecker]: Examining path program with hash 1048300734, occurence #1 [2024-12-05 08:09:52,218 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:52,218 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1711016407, now seen corresponding path program 1 times [2024-12-05 08:09:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762827415] [2024-12-05 08:09:52,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:52,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-05 08:09:52,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:52,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762827415] [2024-12-05 08:09:52,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762827415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:52,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:09:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090974248] [2024-12-05 08:09:52,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:09:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:52,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:09:52,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:09:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:52,338 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:52,338 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-05 08:09:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:53,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-05 08:09:53,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:53,303 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:53,303 INFO L139 ounterexampleChecker]: Examining path program with hash -1141073964, occurence #1 [2024-12-05 08:09:53,303 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:53,303 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:53,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1412460515, now seen corresponding path program 1 times [2024-12-05 08:09:53,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:53,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334750954] [2024-12-05 08:09:53,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:53,623 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-05 08:09:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334750954] [2024-12-05 08:09:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334750954] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:53,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:53,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:09:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16788755] [2024-12-05 08:09:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:53,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:09:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:53,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:09:53,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:09:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:53,625 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:53,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:09:53,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:53,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:53,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:09:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:09:55,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-05 08:09:55,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:55,006 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:55,006 INFO L139 ounterexampleChecker]: Examining path program with hash 1795512107, occurence #1 [2024-12-05 08:09:55,006 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:55,006 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 652703549, now seen corresponding path program 1 times [2024-12-05 08:09:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451779468] [2024-12-05 08:09:55,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:55,048 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:09:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:09:55,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:09:55,089 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:09:55,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:09:55,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:09:55,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-05 08:09:55,090 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:09:55,091 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:09:55,091 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-12-05 08:09:55,126 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-12-05 08:09:55,129 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:55,147 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:09:55,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:09:55,147 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:09:55,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:09:57,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:09:57,291 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:09:57,292 INFO L139 ounterexampleChecker]: Examining path program with hash -1880697739, occurence #1 [2024-12-05 08:09:57,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:09:57,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:09:57,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:09:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -899554568, now seen corresponding path program 1 times [2024-12-05 08:09:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:09:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306658962] [2024-12-05 08:09:57,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:09:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:09:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:09:57,326 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-05 08:09:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:09:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306658962] [2024-12-05 08:09:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306658962] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:09:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:09:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:09:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018094749] [2024-12-05 08:09:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:09:57,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:09:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:09:57,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:09:57,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:09:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:09:57,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:09:57,327 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-05 08:09:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-05 08:10:03,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:03,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:03,425 INFO L139 ounterexampleChecker]: Examining path program with hash 285960391, occurence #1 [2024-12-05 08:10:03,425 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:03,425 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1780699558, now seen corresponding path program 1 times [2024-12-05 08:10:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823887964] [2024-12-05 08:10:03,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:03,561 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-05 08:10:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823887964] [2024-12-05 08:10:03,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823887964] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:03,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:03,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864481686] [2024-12-05 08:10:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:03,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:10:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:03,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:10:03,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:10:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:03,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:03,563 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-05 08:10:03,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:03,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:04,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-05 08:10:04,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:04,563 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:04,564 INFO L139 ounterexampleChecker]: Examining path program with hash -1894408531, occurence #1 [2024-12-05 08:10:04,564 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:04,564 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1759331904, now seen corresponding path program 1 times [2024-12-05 08:10:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222062733] [2024-12-05 08:10:04,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:04,902 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-05 08:10:04,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:04,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222062733] [2024-12-05 08:10:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222062733] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:04,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822851937] [2024-12-05 08:10:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:04,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:10:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:04,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:10:04,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:10:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:04,903 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:04,903 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-05 08:10:04,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:04,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:04,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:10:06,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-05 08:10:06,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:06,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:06,766 INFO L139 ounterexampleChecker]: Examining path program with hash 161835377, occurence #1 [2024-12-05 08:10:06,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:06,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:06,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1780804369, now seen corresponding path program 1 times [2024-12-05 08:10:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721663648] [2024-12-05 08:10:06,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:06,802 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:10:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:06,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:10:06,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:10:06,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:10:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:10:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-05 08:10:06,833 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:10:06,833 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:10:06,833 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-12-05 08:10:06,869 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-12-05 08:10:06,872 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:06,891 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:10:06,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:10:06,891 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:06,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:10:09,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:09,441 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:09,441 INFO L139 ounterexampleChecker]: Examining path program with hash -35031414, occurence #1 [2024-12-05 08:10:09,441 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:09,441 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1814640328, now seen corresponding path program 1 times [2024-12-05 08:10:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363874793] [2024-12-05 08:10:09,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:09,477 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-05 08:10:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363874793] [2024-12-05 08:10:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363874793] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:10:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090079003] [2024-12-05 08:10:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:10:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:09,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:10:09,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:10:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:09,478 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:09,478 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-05 08:10:09,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:16,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-05 08:10:16,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:16,219 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:16,220 INFO L139 ounterexampleChecker]: Examining path program with hash -422231753, occurence #1 [2024-12-05 08:10:16,220 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:16,220 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:16,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1016685027, now seen corresponding path program 1 times [2024-12-05 08:10:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843208142] [2024-12-05 08:10:16,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:16,452 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-05 08:10:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843208142] [2024-12-05 08:10:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843208142] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341420822] [2024-12-05 08:10:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:10:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:10:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:10:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:16,454 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:16,454 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-05 08:10:16,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:16,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:17,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-05 08:10:17,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:17,491 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:17,491 INFO L139 ounterexampleChecker]: Examining path program with hash 2071438025, occurence #1 [2024-12-05 08:10:17,491 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:17,491 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -135451558, now seen corresponding path program 1 times [2024-12-05 08:10:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754484302] [2024-12-05 08:10:17,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:17,810 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-05 08:10:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754484302] [2024-12-05 08:10:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754484302] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:17,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:17,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871349351] [2024-12-05 08:10:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:10:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:17,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:10:17,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:10:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:17,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:17,813 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-05 08:10:17,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:17,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:17,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:10:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-05 08:10:19,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:19,801 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:19,802 INFO L139 ounterexampleChecker]: Examining path program with hash -923467246, occurence #1 [2024-12-05 08:10:19,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:19,802 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -154038347, now seen corresponding path program 1 times [2024-12-05 08:10:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570295574] [2024-12-05 08:10:19,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:19,837 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:10:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:19,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:10:19,871 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:10:19,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:10:19,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:10:19,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-05 08:10:19,873 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:10:19,873 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:10:19,873 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-12-05 08:10:19,909 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-12-05 08:10:19,911 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:19,934 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:10:19,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:10:19,934 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:19,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:10:22,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:22,648 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:22,648 INFO L139 ounterexampleChecker]: Examining path program with hash -744909476, occurence #1 [2024-12-05 08:10:22,648 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:22,648 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2100171378, now seen corresponding path program 1 times [2024-12-05 08:10:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107594501] [2024-12-05 08:10:22,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:22,684 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-05 08:10:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107594501] [2024-12-05 08:10:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107594501] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:10:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128543015] [2024-12-05 08:10:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:10:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:22,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:10:22,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:10:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:22,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:22,686 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-05 08:10:22,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:30,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-05 08:10:30,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:30,694 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:30,694 INFO L139 ounterexampleChecker]: Examining path program with hash -229056398, occurence #1 [2024-12-05 08:10:30,694 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:30,694 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:30,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -47144233, now seen corresponding path program 1 times [2024-12-05 08:10:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928314411] [2024-12-05 08:10:30,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:30,841 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-05 08:10:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928314411] [2024-12-05 08:10:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928314411] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777554168] [2024-12-05 08:10:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:10:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:10:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:10:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:30,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:30,842 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-05 08:10:30,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:30,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:32,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-05 08:10:32,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:32,131 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:32,131 INFO L139 ounterexampleChecker]: Examining path program with hash -987663306, occurence #1 [2024-12-05 08:10:32,131 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:32,131 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1150649009, now seen corresponding path program 1 times [2024-12-05 08:10:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243615676] [2024-12-05 08:10:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:32,436 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-05 08:10:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243615676] [2024-12-05 08:10:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243615676] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138498793] [2024-12-05 08:10:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:10:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:10:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:10:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:32,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:32,437 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-05 08:10:32,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:32,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:32,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:10:34,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-12-05 08:10:34,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:34,992 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:34,992 INFO L139 ounterexampleChecker]: Examining path program with hash -230678242, occurence #1 [2024-12-05 08:10:34,992 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:34,992 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:34,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:34,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1114626690, now seen corresponding path program 1 times [2024-12-05 08:10:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:34,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002196740] [2024-12-05 08:10:34,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:35,029 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:10:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:35,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:10:35,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:10:35,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:10:35,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:10:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-05 08:10:35,064 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:10:35,064 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:10:35,064 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-12-05 08:10:35,107 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-12-05 08:10:35,110 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:35,130 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:10:35,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:10:35,131 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:35,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:10:38,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:38,337 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:38,337 INFO L139 ounterexampleChecker]: Examining path program with hash 1952446501, occurence #1 [2024-12-05 08:10:38,337 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:38,337 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1486337935, now seen corresponding path program 1 times [2024-12-05 08:10:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218081442] [2024-12-05 08:10:38,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:38,374 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-05 08:10:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218081442] [2024-12-05 08:10:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218081442] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:38,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:10:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636911379] [2024-12-05 08:10:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:38,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:10:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:38,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:10:38,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:10:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:38,375 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:38,376 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-05 08:10:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:47,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-05 08:10:47,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:47,318 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:47,318 INFO L139 ounterexampleChecker]: Examining path program with hash 1733957157, occurence #1 [2024-12-05 08:10:47,318 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:47,318 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1574485557, now seen corresponding path program 1 times [2024-12-05 08:10:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147318474] [2024-12-05 08:10:47,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:47,474 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-05 08:10:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147318474] [2024-12-05 08:10:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147318474] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:10:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778531493] [2024-12-05 08:10:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:47,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:10:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:47,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:10:47,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:10:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:47,475 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:47,475 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-05 08:10:47,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:47,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-05 08:10:48,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:48,856 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:48,857 INFO L139 ounterexampleChecker]: Examining path program with hash -2128314647, occurence #1 [2024-12-05 08:10:48,857 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:48,857 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 558511765, now seen corresponding path program 2 times [2024-12-05 08:10:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666711209] [2024-12-05 08:10:48,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:10:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:48,902 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:10:48,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:10:49,151 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-05 08:10:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666711209] [2024-12-05 08:10:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666711209] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:10:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167772878] [2024-12-05 08:10:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:49,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:10:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:49,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:10:49,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:10:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:49,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:10:49,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:49,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:49,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:10:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:10:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-05 08:10:52,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:52,102 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:52,102 INFO L139 ounterexampleChecker]: Examining path program with hash -1770497862, occurence #1 [2024-12-05 08:10:52,102 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:52,102 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1381085353, now seen corresponding path program 1 times [2024-12-05 08:10:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643092885] [2024-12-05 08:10:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:52,152 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:10:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:10:52,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:10:52,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:10:52,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:10:52,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:10:52,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-12-05 08:10:52,216 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:10:52,216 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:10:52,216 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-12-05 08:10:52,265 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-12-05 08:10:52,269 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:52,296 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:10:52,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:10:52,297 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:10:52,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:10:55,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:10:55,882 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:10:55,882 INFO L139 ounterexampleChecker]: Examining path program with hash -1611578571, occurence #1 [2024-12-05 08:10:55,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:10:55,882 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:10:55,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:10:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 913498480, now seen corresponding path program 1 times [2024-12-05 08:10:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:10:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393479907] [2024-12-05 08:10:55,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:10:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:10:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:10:55,922 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-05 08:10:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:10:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393479907] [2024-12-05 08:10:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393479907] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:10:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:10:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:10:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98502396] [2024-12-05 08:10:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:10:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:10:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:10:55,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:10:55,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:10:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:10:55,923 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:10:55,924 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-05 08:10:55,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-05 08:11:06,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:06,226 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:06,226 INFO L139 ounterexampleChecker]: Examining path program with hash 1526647722, occurence #1 [2024-12-05 08:11:06,226 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:06,226 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:06,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash 778940902, now seen corresponding path program 1 times [2024-12-05 08:11:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516466040] [2024-12-05 08:11:06,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:11:06,463 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-05 08:11:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516466040] [2024-12-05 08:11:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516466040] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:11:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337699388] [2024-12-05 08:11:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:11:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:06,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:11:06,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:11:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:06,465 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:06,465 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-05 08:11:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:07,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-12-05 08:11:07,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:07,924 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:07,924 INFO L139 ounterexampleChecker]: Examining path program with hash 1686221563, occurence #1 [2024-12-05 08:11:07,924 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:07,924 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash 915237622, now seen corresponding path program 2 times [2024-12-05 08:11:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751898971] [2024-12-05 08:11:07,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:11:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:07,969 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:11:07,969 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:11:08,244 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-05 08:11:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751898971] [2024-12-05 08:11:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751898971] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:08,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:11:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046048454] [2024-12-05 08:11:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:08,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:11:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:08,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:11:08,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:11:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:08,245 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:11:08,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:08,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:08,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:11:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-12-05 08:11:11,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:11,556 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:11,556 INFO L139 ounterexampleChecker]: Examining path program with hash 1464978862, occurence #1 [2024-12-05 08:11:11,556 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:11,556 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1362454283, now seen corresponding path program 1 times [2024-12-05 08:11:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853929489] [2024-12-05 08:11:11,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:11,596 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:11:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:11,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:11:11,657 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:11:11,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:11:11,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:11:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-12-05 08:11:11,659 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:11:11,659 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:11:11,659 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-12-05 08:11:11,710 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-12-05 08:11:11,713 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:11,743 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:11:11,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:11:11,744 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:11,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:11:15,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:15,669 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:15,669 INFO L139 ounterexampleChecker]: Examining path program with hash -529377368, occurence #1 [2024-12-05 08:11:15,669 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:15,669 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash -682520054, now seen corresponding path program 1 times [2024-12-05 08:11:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:15,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118769211] [2024-12-05 08:11:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:11:15,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-05 08:11:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118769211] [2024-12-05 08:11:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118769211] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:11:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053607741] [2024-12-05 08:11:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:11:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:15,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:11:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:11:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:15,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:15,709 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-05 08:11:15,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-12-05 08:11:26,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:26,948 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:26,948 INFO L139 ounterexampleChecker]: Examining path program with hash -2051346794, occurence #1 [2024-12-05 08:11:26,948 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:26,948 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1280806378, now seen corresponding path program 1 times [2024-12-05 08:11:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668387880] [2024-12-05 08:11:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:11:27,137 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-05 08:11:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:27,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668387880] [2024-12-05 08:11:27,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668387880] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:27,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:11:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116768196] [2024-12-05 08:11:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:27,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:11:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:27,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:11:27,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:11:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:27,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:27,139 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-05 08:11:27,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:27,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-12-05 08:11:28,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:28,671 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:28,671 INFO L139 ounterexampleChecker]: Examining path program with hash 2046199000, occurence #1 [2024-12-05 08:11:28,671 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:28,671 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:28,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1044746942, now seen corresponding path program 2 times [2024-12-05 08:11:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075437961] [2024-12-05 08:11:28,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:11:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:28,716 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:11:28,716 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:11:29,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-05 08:11:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:29,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075437961] [2024-12-05 08:11:29,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075437961] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:29,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:29,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:11:29,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654458135] [2024-12-05 08:11:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:29,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:11:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:29,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:11:29,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:11:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:29,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:29,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:11:29,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:29,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:29,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:11:33,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-12-05 08:11:33,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:33,173 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:33,173 INFO L139 ounterexampleChecker]: Examining path program with hash 1554230770, occurence #1 [2024-12-05 08:11:33,173 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:33,173 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 472962896, now seen corresponding path program 1 times [2024-12-05 08:11:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108398291] [2024-12-05 08:11:33,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:33,214 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:11:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:33,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:11:33,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:11:33,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:11:33,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:11:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-12-05 08:11:33,254 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:11:33,254 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:11:33,254 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-12-05 08:11:33,299 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-12-05 08:11:33,302 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:33,327 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:11:33,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:11:33,328 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:33,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:11:37,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:37,580 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:37,580 INFO L139 ounterexampleChecker]: Examining path program with hash -450644274, occurence #1 [2024-12-05 08:11:37,580 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:37,580 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:37,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 746570194, now seen corresponding path program 1 times [2024-12-05 08:11:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98476274] [2024-12-05 08:11:37,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:11:37,705 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-05 08:11:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:37,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98476274] [2024-12-05 08:11:37,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98476274] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:37,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:37,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:11:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701198125] [2024-12-05 08:11:37,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:37,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:11:37,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:37,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:11:37,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:11:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:37,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:37,707 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-05 08:11:37,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-12-05 08:11:50,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:50,235 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:50,236 INFO L139 ounterexampleChecker]: Examining path program with hash 222833857, occurence #1 [2024-12-05 08:11:50,236 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:50,236 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1319990017, now seen corresponding path program 1 times [2024-12-05 08:11:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484781271] [2024-12-05 08:11:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:11:50,421 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-05 08:11:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484781271] [2024-12-05 08:11:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484781271] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:11:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532756259] [2024-12-05 08:11:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:11:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:50,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:11:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:11:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:50,423 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:50,423 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-05 08:11:50,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:50,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-12-05 08:11:51,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:51,807 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:51,807 INFO L139 ounterexampleChecker]: Examining path program with hash -905971434, occurence #1 [2024-12-05 08:11:51,807 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:51,807 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -939581503, now seen corresponding path program 2 times [2024-12-05 08:11:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353712245] [2024-12-05 08:11:51,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:11:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:51,848 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:11:51,848 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:11:52,226 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-05 08:11:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:11:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353712245] [2024-12-05 08:11:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353712245] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:11:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:11:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:11:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540231451] [2024-12-05 08:11:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:11:52,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:11:52,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:11:52,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:11:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:11:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:52,228 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:11:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:11:52,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:52,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:52,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:11:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:11:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:11:56,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-12-05 08:11:56,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:11:56,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:11:56,972 INFO L139 ounterexampleChecker]: Examining path program with hash 1822104931, occurence #1 [2024-12-05 08:11:56,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:11:56,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:11:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:11:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1165419744, now seen corresponding path program 1 times [2024-12-05 08:11:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:11:56,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235795987] [2024-12-05 08:11:56,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:11:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:11:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:57,012 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:11:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:11:57,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:11:57,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:11:57,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:11:57,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:11:57,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-12-05 08:11:57,058 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:11:57,058 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:11:57,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-12-05 08:11:57,101 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-12-05 08:11:57,103 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:57,130 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:11:57,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:11:57,131 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:11:57,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:12:02,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:02,095 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:02,095 INFO L139 ounterexampleChecker]: Examining path program with hash -1260555013, occurence #1 [2024-12-05 08:12:02,095 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:02,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:02,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:02,095 INFO L85 PathProgramCache]: Analyzing trace with hash 163080687, now seen corresponding path program 1 times [2024-12-05 08:12:02,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:02,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160699322] [2024-12-05 08:12:02,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:02,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:12:02,141 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-05 08:12:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160699322] [2024-12-05 08:12:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160699322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:12:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672754962] [2024-12-05 08:12:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:02,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:12:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:02,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:12:02,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:12:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:02,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:02,142 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-05 08:12:02,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-12-05 08:12:16,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:16,092 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:16,092 INFO L139 ounterexampleChecker]: Examining path program with hash 957359268, occurence #1 [2024-12-05 08:12:16,092 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:16,092 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 488625174, now seen corresponding path program 1 times [2024-12-05 08:12:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092607521] [2024-12-05 08:12:16,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:12:16,296 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-05 08:12:16,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:16,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092607521] [2024-12-05 08:12:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092607521] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:12:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465377057] [2024-12-05 08:12:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:16,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:12:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:16,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:12:16,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:12:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:16,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:16,298 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-05 08:12:16,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:16,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:17,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-12-05 08:12:17,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:17,832 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:17,833 INFO L139 ounterexampleChecker]: Examining path program with hash 2117981606, occurence #1 [2024-12-05 08:12:17,833 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:17,833 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:17,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1149059630, now seen corresponding path program 2 times [2024-12-05 08:12:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:17,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117544583] [2024-12-05 08:12:17,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:12:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:17,961 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:12:17,961 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:12:18,293 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-05 08:12:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117544583] [2024-12-05 08:12:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117544583] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:12:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563652567] [2024-12-05 08:12:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:12:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:12:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:12:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:18,294 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:18,295 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-05 08:12:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:12:23,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-12-05 08:12:23,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:23,336 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:23,336 INFO L139 ounterexampleChecker]: Examining path program with hash -1044725575, occurence #1 [2024-12-05 08:12:23,336 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:23,336 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:23,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 752975503, now seen corresponding path program 1 times [2024-12-05 08:12:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:23,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421934094] [2024-12-05 08:12:23,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:23,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:12:23,382 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:12:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:12:23,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:12:23,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:12:23,429 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:12:23,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:12:23,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-12-05 08:12:23,431 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:12:23,431 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:12:23,431 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-12-05 08:12:23,481 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-12-05 08:12:23,483 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:12:23,511 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:12:23,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:12:23,512 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:12:23,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:12:29,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:29,105 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:29,105 INFO L139 ounterexampleChecker]: Examining path program with hash 913922470, occurence #1 [2024-12-05 08:12:29,105 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:29,105 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:29,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash -779585250, now seen corresponding path program 1 times [2024-12-05 08:12:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651855173] [2024-12-05 08:12:29,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:12:29,155 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-05 08:12:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:29,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651855173] [2024-12-05 08:12:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651855173] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:29,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:12:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628256786] [2024-12-05 08:12:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:29,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:12:29,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:29,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:12:29,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:12:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:29,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:29,156 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-05 08:12:29,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:44,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-12-05 08:12:44,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:44,285 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:44,285 INFO L139 ounterexampleChecker]: Examining path program with hash -665196886, occurence #1 [2024-12-05 08:12:44,285 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:44,285 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:44,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2051160626, now seen corresponding path program 1 times [2024-12-05 08:12:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173693361] [2024-12-05 08:12:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:12:44,499 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-05 08:12:44,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173693361] [2024-12-05 08:12:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173693361] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:44,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:12:44,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121072364] [2024-12-05 08:12:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:12:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:12:44,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:12:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:44,501 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:44,501 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-05 08:12:44,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:44,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:45,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-12-05 08:12:45,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:45,965 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:45,965 INFO L139 ounterexampleChecker]: Examining path program with hash -472346293, occurence #1 [2024-12-05 08:12:45,965 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:45,965 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash 548734838, now seen corresponding path program 2 times [2024-12-05 08:12:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2750943] [2024-12-05 08:12:45,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:12:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:46,012 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:12:46,012 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:12:46,424 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-05 08:12:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2750943] [2024-12-05 08:12:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2750943] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:46,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:46,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:12:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234047283] [2024-12-05 08:12:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:12:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:46,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:12:46,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:12:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:46,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:12:46,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:46,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:46,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:12:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:12:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-12-05 08:12:52,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:52,269 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:52,269 INFO L139 ounterexampleChecker]: Examining path program with hash 417366813, occurence #1 [2024-12-05 08:12:52,269 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:52,269 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:52,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -900389851, now seen corresponding path program 1 times [2024-12-05 08:12:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008511361] [2024-12-05 08:12:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:12:52,324 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:12:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:12:52,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:12:52,381 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:12:52,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:12:52,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:12:52,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-12-05 08:12:52,382 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:12:52,383 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:12:52,383 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-12-05 08:12:52,438 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-12-05 08:12:52,442 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:12:52,477 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:12:52,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:12:52,478 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:12:52,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:12:58,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:12:58,488 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:12:58,488 INFO L139 ounterexampleChecker]: Examining path program with hash 697130909, occurence #1 [2024-12-05 08:12:58,488 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:12:58,488 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:12:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:12:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -173296568, now seen corresponding path program 1 times [2024-12-05 08:12:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:12:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599443856] [2024-12-05 08:12:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:12:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:12:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:12:58,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-05 08:12:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:12:58,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599443856] [2024-12-05 08:12:58,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599443856] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:12:58,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:12:58,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:12:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152904018] [2024-12-05 08:12:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:12:58,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:12:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:12:58,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:12:58,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:12:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:12:58,538 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:12:58,538 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-05 08:12:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-12-05 08:13:14,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:14,949 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:14,950 INFO L139 ounterexampleChecker]: Examining path program with hash 1092006496, occurence #1 [2024-12-05 08:13:14,950 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:14,950 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:14,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -724670991, now seen corresponding path program 1 times [2024-12-05 08:13:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675415093] [2024-12-05 08:13:14,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:13:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:13:15,179 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-05 08:13:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:13:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675415093] [2024-12-05 08:13:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675415093] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:13:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:13:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:13:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445321133] [2024-12-05 08:13:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:13:15,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:13:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:13:15,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:13:15,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:13:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:15,181 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:13:15,181 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-05 08:13:15,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:15,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:16,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-12-05 08:13:16,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:16,656 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:16,656 INFO L139 ounterexampleChecker]: Examining path program with hash -343634704, occurence #1 [2024-12-05 08:13:16,656 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:16,656 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1659628953, now seen corresponding path program 2 times [2024-12-05 08:13:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380409366] [2024-12-05 08:13:16,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:13:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:16,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:13:16,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:13:17,126 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-05 08:13:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:13:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380409366] [2024-12-05 08:13:17,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380409366] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:13:17,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:13:17,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:13:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653695759] [2024-12-05 08:13:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:13:17,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:13:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:13:17,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:13:17,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:13:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:17,128 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:13:17,128 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-05 08:13:17,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:17,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:17,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:13:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-12-05 08:13:23,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:23,535 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:23,535 INFO L139 ounterexampleChecker]: Examining path program with hash 314169901, occurence #1 [2024-12-05 08:13:23,535 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:23,535 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:23,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1806937062, now seen corresponding path program 1 times [2024-12-05 08:13:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880432104] [2024-12-05 08:13:23,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:13:23,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:13:23,582 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:13:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:13:23,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:13:23,639 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:13:23,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:13:23,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:13:23,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-12-05 08:13:23,641 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:13:23,641 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:13:23,641 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-12-05 08:13:23,691 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-12-05 08:13:23,693 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:13:23,727 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:13:23,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:13:23,727 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:13:23,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:13:30,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:30,227 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:30,228 INFO L139 ounterexampleChecker]: Examining path program with hash 1133501100, occurence #1 [2024-12-05 08:13:30,228 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:30,228 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash 53022168, now seen corresponding path program 1 times [2024-12-05 08:13:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392655544] [2024-12-05 08:13:30,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:13:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:13:30,280 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-05 08:13:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:13:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392655544] [2024-12-05 08:13:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392655544] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:13:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:13:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:13:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651717391] [2024-12-05 08:13:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:13:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:13:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:13:30,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:13:30,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:13:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:30,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:13:30,281 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-05 08:13:30,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:48,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-12-05 08:13:48,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:48,228 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:48,228 INFO L139 ounterexampleChecker]: Examining path program with hash 893991821, occurence #1 [2024-12-05 08:13:48,228 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:48,228 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:48,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -893303314, now seen corresponding path program 1 times [2024-12-05 08:13:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175629618] [2024-12-05 08:13:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:13:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:13:48,463 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-05 08:13:48,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:13:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175629618] [2024-12-05 08:13:48,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175629618] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:13:48,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:13:48,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:13:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756380215] [2024-12-05 08:13:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:13:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:13:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:13:48,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:13:48,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:13:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:48,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:13:48,464 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-05 08:13:48,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:48,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:49,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-12-05 08:13:49,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:49,969 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:49,970 INFO L139 ounterexampleChecker]: Examining path program with hash -1253873536, occurence #1 [2024-12-05 08:13:49,970 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:49,970 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:49,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash 119685606, now seen corresponding path program 2 times [2024-12-05 08:13:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336858178] [2024-12-05 08:13:49,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:13:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:50,037 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:13:50,037 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:13:50,526 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-05 08:13:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:13:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336858178] [2024-12-05 08:13:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336858178] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:13:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:13:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:13:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29573239] [2024-12-05 08:13:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:13:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:13:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:13:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:13:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:13:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:50,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:13:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:13:50,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:50,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:50,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:13:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:13:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:13:57,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-12-05 08:13:57,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:13:57,552 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:13:57,552 INFO L139 ounterexampleChecker]: Examining path program with hash 1846550562, occurence #1 [2024-12-05 08:13:57,552 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:13:57,552 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:13:57,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:13:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1700874149, now seen corresponding path program 1 times [2024-12-05 08:13:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:13:57,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817933612] [2024-12-05 08:13:57,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:13:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:13:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:13:57,604 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:13:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:13:57,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:13:57,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:13:57,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:13:57,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:13:57,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-12-05 08:13:57,669 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:13:57,669 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:13:57,669 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-12-05 08:13:57,732 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-12-05 08:13:57,735 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:13:57,777 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:13:57,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:13:57,778 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:13:57,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:14:05,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:14:05,095 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:14:05,096 INFO L139 ounterexampleChecker]: Examining path program with hash -53007654, occurence #1 [2024-12-05 08:14:05,096 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:14:05,096 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:14:05,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:14:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1953706587, now seen corresponding path program 1 times [2024-12-05 08:14:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:14:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044004339] [2024-12-05 08:14:05,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:14:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:14:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:14:05,230 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-05 08:14:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:14:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044004339] [2024-12-05 08:14:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044004339] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:14:05,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:14:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:14:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187070414] [2024-12-05 08:14:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:14:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:14:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:14:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:14:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:14:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:05,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:14:05,232 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-05 08:14:05,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-12-05 08:14:24,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:14:24,834 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:14:24,835 INFO L139 ounterexampleChecker]: Examining path program with hash -1071186885, occurence #1 [2024-12-05 08:14:24,835 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:14:24,835 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:14:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:14:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash -520434790, now seen corresponding path program 1 times [2024-12-05 08:14:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:14:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892145798] [2024-12-05 08:14:24,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:14:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:14:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:14:25,267 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-05 08:14:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:14:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892145798] [2024-12-05 08:14:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892145798] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:14:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:14:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:14:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953912366] [2024-12-05 08:14:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:14:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:14:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:14:25,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:14:25,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:14:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:25,269 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:14:25,269 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-05 08:14:25,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:25,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:14:26,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-12-05 08:14:26,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:14:26,953 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:14:26,953 INFO L139 ounterexampleChecker]: Examining path program with hash 1650411803, occurence #1 [2024-12-05 08:14:26,953 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:14:26,953 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:14:26,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:14:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1476454220, now seen corresponding path program 2 times [2024-12-05 08:14:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:14:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31249449] [2024-12-05 08:14:26,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:14:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:14:27,010 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:14:27,010 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:14:27,408 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-05 08:14:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:14:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31249449] [2024-12-05 08:14:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31249449] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:14:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:14:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:14:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570341410] [2024-12-05 08:14:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:14:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:14:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:14:27,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:14:27,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:14:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:27,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:14:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:14:27,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:27,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:14:27,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:14:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:14:34,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-12-05 08:14:34,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:14:34,984 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:14:34,984 INFO L139 ounterexampleChecker]: Examining path program with hash -2119163111, occurence #1 [2024-12-05 08:14:34,984 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:14:34,984 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:14:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:14:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 294209927, now seen corresponding path program 1 times [2024-12-05 08:14:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:14:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617034327] [2024-12-05 08:14:34,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:14:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:14:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:14:35,037 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:14:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:14:35,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:14:35,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:14:35,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:14:35,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:14:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-12-05 08:14:35,101 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:14:35,101 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:14:35,101 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-12-05 08:14:35,150 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-12-05 08:14:35,152 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:14:35,187 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:14:35,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:14:35,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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:14:35,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:14:43,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:14:43,146 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:14:43,146 INFO L139 ounterexampleChecker]: Examining path program with hash -748558513, occurence #1 [2024-12-05 08:14:43,146 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:14:43,146 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:14:43,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:14:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1247469430, now seen corresponding path program 1 times [2024-12-05 08:14:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:14:43,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638034955] [2024-12-05 08:14:43,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:14:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:14:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:14:43,204 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-05 08:14:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:14:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638034955] [2024-12-05 08:14:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638034955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:14:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:14:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:14:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278698879] [2024-12-05 08:14:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:14:43,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:14:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:14:43,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:14:43,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:14:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:14:43,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:14:43,205 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-05 08:14:43,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:04,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-12-05 08:15:04,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:04,340 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:04,341 INFO L139 ounterexampleChecker]: Examining path program with hash 111614486, occurence #1 [2024-12-05 08:15:04,341 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:04,341 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -766268289, now seen corresponding path program 1 times [2024-12-05 08:15:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462004120] [2024-12-05 08:15:04,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:15:04,597 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-05 08:15:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:15:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462004120] [2024-12-05 08:15:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462004120] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:15:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:15:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:15:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673786170] [2024-12-05 08:15:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:15:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:15:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:15:04,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:15:04,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:15:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:04,598 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:15:04,598 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-05 08:15:04,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:04,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:06,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-12-05 08:15:06,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:06,158 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:06,158 INFO L139 ounterexampleChecker]: Examining path program with hash 1331174685, occurence #1 [2024-12-05 08:15:06,158 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:06,158 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2120301483, now seen corresponding path program 2 times [2024-12-05 08:15:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215401557] [2024-12-05 08:15:06,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:15:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:06,210 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:15:06,211 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:15:06,623 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-05 08:15:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:15:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215401557] [2024-12-05 08:15:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215401557] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:15:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:15:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:15:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062342693] [2024-12-05 08:15:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:15:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:15:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:15:06,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:15:06,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:15:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:06,625 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:15:06,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:15:06,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:06,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:06,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:15:14,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-12-05 08:15:14,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:14,837 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:14,837 INFO L139 ounterexampleChecker]: Examining path program with hash -1605616549, occurence #1 [2024-12-05 08:15:14,837 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:14,837 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1787312351, now seen corresponding path program 1 times [2024-12-05 08:15:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209304494] [2024-12-05 08:15:14,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:14,892 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:14,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:14,963 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:14,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:14,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:14,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-12-05 08:15:14,965 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:15:14,965 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:14,965 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-12-05 08:15:15,020 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-12-05 08:15:15,022 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:15,056 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:15,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:15,057 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:15,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:23,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:23,955 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:23,955 INFO L139 ounterexampleChecker]: Examining path program with hash 356269579, occurence #1 [2024-12-05 08:15:23,955 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:23,956 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 255789494, now seen corresponding path program 1 times [2024-12-05 08:15:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194207456] [2024-12-05 08:15:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:15:24,017 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-05 08:15:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:15:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194207456] [2024-12-05 08:15:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194207456] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:15:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:15:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:15:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396780712] [2024-12-05 08:15:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:15:24,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:15:24,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:15:24,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:15:24,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:15:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:24,018 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:15:24,018 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-05 08:15:24,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:47,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-12-05 08:15:47,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:47,121 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:47,121 INFO L139 ounterexampleChecker]: Examining path program with hash -1144477805, occurence #1 [2024-12-05 08:15:47,121 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:47,121 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:47,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1071888528, now seen corresponding path program 1 times [2024-12-05 08:15:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102934597] [2024-12-05 08:15:47,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:15:47,393 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-05 08:15:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:15:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102934597] [2024-12-05 08:15:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102934597] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:15:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:15:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:15:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717358685] [2024-12-05 08:15:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:15:47,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:15:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:15:47,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:15:47,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:15:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:47,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:15:47,395 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-05 08:15:47,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:47,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-12-05 08:15:49,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:49,277 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:49,277 INFO L139 ounterexampleChecker]: Examining path program with hash -1085831016, occurence #1 [2024-12-05 08:15:49,277 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:49,277 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1252724346, now seen corresponding path program 2 times [2024-12-05 08:15:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53286577] [2024-12-05 08:15:49,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:15:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:49,336 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:15:49,336 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:15:49,869 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-05 08:15:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:15:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53286577] [2024-12-05 08:15:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53286577] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:15:49,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:15:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:15:49,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587539963] [2024-12-05 08:15:49,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:15:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:15:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:15:49,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:15:49,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:15:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:49,871 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:15:49,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:15:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:15:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:15:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:15:59,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-12-05 08:15:59,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:59,100 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:59,100 INFO L139 ounterexampleChecker]: Examining path program with hash 486127982, occurence #1 [2024-12-05 08:15:59,100 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:59,100 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:59,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash -26022255, now seen corresponding path program 1 times [2024-12-05 08:15:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:59,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204005618] [2024-12-05 08:15:59,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:59,159 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:59,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:59,244 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:59,244 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:59,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-12-05 08:15:59,246 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:15:59,247 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:59,247 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-12-05 08:15:59,309 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-12-05 08:15:59,313 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:59,355 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:59,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:59,356 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:59,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:09,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:09,010 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:09,011 INFO L139 ounterexampleChecker]: Examining path program with hash 538273232, occurence #1 [2024-12-05 08:16:09,011 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:09,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1224366398, now seen corresponding path program 1 times [2024-12-05 08:16:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105761303] [2024-12-05 08:16:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:16:09,074 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-05 08:16:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:16:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105761303] [2024-12-05 08:16:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105761303] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:16:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:16:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:16:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936744993] [2024-12-05 08:16:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:16:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:16:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:16:09,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:16:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:16:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:09,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:16:09,076 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-05 08:16:09,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:34,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-12-05 08:16:34,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:34,401 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:34,401 INFO L139 ounterexampleChecker]: Examining path program with hash -707575114, occurence #1 [2024-12-05 08:16:34,401 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:34,401 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:34,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1082998488, now seen corresponding path program 1 times [2024-12-05 08:16:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:34,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126301240] [2024-12-05 08:16:34,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:16:34,713 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-05 08:16:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:16:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126301240] [2024-12-05 08:16:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126301240] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:16:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:16:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:16:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557289457] [2024-12-05 08:16:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:16:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:16:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:16:34,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:16:34,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:16:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:34,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:16:34,715 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-05 08:16:34,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:34,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:16:36,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-12-05 08:16:36,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:36,597 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:36,597 INFO L139 ounterexampleChecker]: Examining path program with hash 1737804770, occurence #1 [2024-12-05 08:16:36,597 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:36,597 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:36,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2122867246, now seen corresponding path program 2 times [2024-12-05 08:16:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040650154] [2024-12-05 08:16:36,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:16:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:36,657 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:16:36,657 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:16:37,118 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-05 08:16:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:16:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040650154] [2024-12-05 08:16:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040650154] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:16:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:16:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:16:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194050183] [2024-12-05 08:16:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:16:37,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:16:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:16:37,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:16:37,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:16:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:37,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:16:37,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:16:37,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:37,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:16:37,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:16:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:16:48,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-12-05 08:16:48,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:48,040 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:48,040 INFO L139 ounterexampleChecker]: Examining path program with hash 1914579600, occurence #1 [2024-12-05 08:16:48,040 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:48,040 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:48,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash -894527490, now seen corresponding path program 1 times [2024-12-05 08:16:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:48,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636460058] [2024-12-05 08:16:48,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:48,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:48,113 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:48,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:48,232 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:48,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:48,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-12-05 08:16:48,235 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:16:48,235 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:48,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-12-05 08:16:48,288 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-12-05 08:16:48,290 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:48,327 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:48,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:48,328 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:48,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:58,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:58,538 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:58,539 INFO L139 ounterexampleChecker]: Examining path program with hash -1169901584, occurence #1 [2024-12-05 08:16:58,539 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:58,539 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1631325425, now seen corresponding path program 1 times [2024-12-05 08:16:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268726059] [2024-12-05 08:16:58,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:16:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:16:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:16:58,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268726059] [2024-12-05 08:16:58,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268726059] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:16:58,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:16:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:16:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119007523] [2024-12-05 08:16:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:16:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:16:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:16:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:16:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:16:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:16:58,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:16:58,616 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-05 08:16:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-12-05 08:17:26,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:26,307 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:26,307 INFO L139 ounterexampleChecker]: Examining path program with hash 1114760623, occurence #1 [2024-12-05 08:17:26,307 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:26,307 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash -474670593, now seen corresponding path program 1 times [2024-12-05 08:17:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:26,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876328303] [2024-12-05 08:17:26,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:17:26,846 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-05 08:17:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:17:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876328303] [2024-12-05 08:17:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876328303] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:17:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:17:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:17:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711739395] [2024-12-05 08:17:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:17:26,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:17:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:17:26,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:17:26,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:17:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:26,849 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:17:26,849 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-05 08:17:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:17:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-12-05 08:17:28,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:28,775 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:28,775 INFO L139 ounterexampleChecker]: Examining path program with hash -1692931128, occurence #1 [2024-12-05 08:17:28,776 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:28,776 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 721048097, now seen corresponding path program 2 times [2024-12-05 08:17:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974346876] [2024-12-05 08:17:28,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:17:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:28,860 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:17:28,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:17:29,375 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-05 08:17:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:17:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974346876] [2024-12-05 08:17:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974346876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:17:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:17:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:17:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396785855] [2024-12-05 08:17:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:17:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:17:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:17:29,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:17:29,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:17:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:29,377 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:17:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:17:29,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:29,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:17:29,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:17:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:17:41,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-12-05 08:17:41,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:41,353 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:41,353 INFO L139 ounterexampleChecker]: Examining path program with hash 1524284737, occurence #1 [2024-12-05 08:17:41,353 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:41,353 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1173929239, now seen corresponding path program 1 times [2024-12-05 08:17:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:41,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443832661] [2024-12-05 08:17:41,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:41,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:41,418 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:17:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:41,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:17:41,538 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:17:41,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:17:41,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:17:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-12-05 08:17:41,541 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:17:41,541 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:17:41,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-12-05 08:17:41,602 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-12-05 08:17:41,606 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:41,645 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:17:41,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:17:41,646 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:41,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:17:52,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:52,928 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:52,929 INFO L139 ounterexampleChecker]: Examining path program with hash -982098179, occurence #1 [2024-12-05 08:17:52,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:52,929 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1940400244, now seen corresponding path program 1 times [2024-12-05 08:17:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388967991] [2024-12-05 08:17:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:17:52,993 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-05 08:17:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:17:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388967991] [2024-12-05 08:17:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388967991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:17:52,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:17:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:17:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950679593] [2024-12-05 08:17:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:17:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:17:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:17:52,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:17:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:17:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:17:52,994 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:17:52,994 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-05 08:17:52,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:21,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-12-05 08:18:21,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:21,336 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:21,336 INFO L139 ounterexampleChecker]: Examining path program with hash -2114714115, occurence #1 [2024-12-05 08:18:21,336 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:21,336 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 849101337, now seen corresponding path program 1 times [2024-12-05 08:18:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171824638] [2024-12-05 08:18:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:21,656 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-05 08:18:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171824638] [2024-12-05 08:18:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171824638] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:18:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259958527] [2024-12-05 08:18:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:18:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:18:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:18:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:21,657 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:21,657 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-05 08:18:21,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:21,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:23,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-12-05 08:18:23,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:23,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:23,426 INFO L139 ounterexampleChecker]: Examining path program with hash -687103707, occurence #1 [2024-12-05 08:18:23,426 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:23,426 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:23,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1096255925, now seen corresponding path program 2 times [2024-12-05 08:18:23,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:23,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639656048] [2024-12-05 08:18:23,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:18:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:23,489 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:18:23,489 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:18:24,206 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-05 08:18:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639656048] [2024-12-05 08:18:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639656048] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:18:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556101203] [2024-12-05 08:18:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:24,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:18:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:24,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:18:24,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:18:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:24,208 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:24,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:24,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:24,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:18:36,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-12-05 08:18:36,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:36,020 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:36,020 INFO L139 ounterexampleChecker]: Examining path program with hash 2106023435, occurence #1 [2024-12-05 08:18:36,020 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:36,020 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash 505669688, now seen corresponding path program 1 times [2024-12-05 08:18:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170417309] [2024-12-05 08:18:36,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:36,120 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:36,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:36,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:36,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:36,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:36,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-12-05 08:18:36,256 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:18:36,256 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:36,256 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-12-05 08:18:36,329 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-12-05 08:18:36,334 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:36,375 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:36,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:36,376 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:36,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:48,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:48,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:48,156 INFO L139 ounterexampleChecker]: Examining path program with hash -1402112530, occurence #1 [2024-12-05 08:18:48,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:48,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1899184712, now seen corresponding path program 1 times [2024-12-05 08:18:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333049620] [2024-12-05 08:18:48,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:48,229 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-05 08:18:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333049620] [2024-12-05 08:18:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333049620] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:18:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777003737] [2024-12-05 08:18:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:48,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:18:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:48,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:18:48,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:18:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:48,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:48,230 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-05 08:18:48,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-12-05 08:19:18,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:18,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:18,836 INFO L139 ounterexampleChecker]: Examining path program with hash -2047580203, occurence #1 [2024-12-05 08:19:18,836 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:18,836 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash -857268304, now seen corresponding path program 1 times [2024-12-05 08:19:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418550981] [2024-12-05 08:19:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:19,158 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-05 08:19:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418550981] [2024-12-05 08:19:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418550981] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448689041] [2024-12-05 08:19:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:19,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:19,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:19,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:19,160 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:19,160 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-05 08:19:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-12-05 08:19:20,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:20,986 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:20,987 INFO L139 ounterexampleChecker]: Examining path program with hash -231624122, occurence #1 [2024-12-05 08:19:20,987 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:20,987 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:20,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 895733980, now seen corresponding path program 2 times [2024-12-05 08:19:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732962267] [2024-12-05 08:19:20,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:19:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:21,083 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:19:21,083 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:19:21,489 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-05 08:19:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732962267] [2024-12-05 08:19:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732962267] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:21,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:21,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:21,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550855085] [2024-12-05 08:19:21,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:21,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:21,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:21,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:21,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:21,490 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-05 08:19:21,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:21,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:21,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-12-05 08:19:34,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:34,277 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:34,277 INFO L139 ounterexampleChecker]: Examining path program with hash 1463807356, occurence #1 [2024-12-05 08:19:34,277 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:34,277 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash 260147602, now seen corresponding path program 1 times [2024-12-05 08:19:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155892181] [2024-12-05 08:19:34,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:34,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:34,341 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:34,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:34,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:34,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:34,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:34,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-12-05 08:19:34,445 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:19:34,445 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:34,445 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-12-05 08:19:34,507 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-12-05 08:19:34,510 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:34,562 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:34,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:34,563 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:34,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:46,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:46,943 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:46,943 INFO L139 ounterexampleChecker]: Examining path program with hash 1049783512, occurence #1 [2024-12-05 08:19:46,943 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:46,943 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1600934254, now seen corresponding path program 1 times [2024-12-05 08:19:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558765493] [2024-12-05 08:19:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:47,017 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-05 08:19:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558765493] [2024-12-05 08:19:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558765493] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53717547] [2024-12-05 08:19:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:47,018 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:47,018 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-05 08:19:47,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:20,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-12-05 08:20:20,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:20,358 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:20,359 INFO L139 ounterexampleChecker]: Examining path program with hash -1173914761, occurence #1 [2024-12-05 08:20:20,359 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:20,359 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:20,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash 988591891, now seen corresponding path program 1 times [2024-12-05 08:20:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818060363] [2024-12-05 08:20:20,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:20,839 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-05 08:20:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818060363] [2024-12-05 08:20:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818060363] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446513374] [2024-12-05 08:20:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:20:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:20,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:20:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:20:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:20,841 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:20,841 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-05 08:20:20,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:20,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-12-05 08:20:22,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:22,853 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:22,853 INFO L139 ounterexampleChecker]: Examining path program with hash 56411696, occurence #1 [2024-12-05 08:20:22,853 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:22,853 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1161579709, now seen corresponding path program 2 times [2024-12-05 08:20:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586116822] [2024-12-05 08:20:22,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:20:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:22,971 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:20:22,971 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:20:23,767 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-05 08:20:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586116822] [2024-12-05 08:20:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586116822] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879227073] [2024-12-05 08:20:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:20:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:23,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:20:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:20:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,769 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:23,769 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-05 08:20:23,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:23,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:20:37,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-12-05 08:20:37,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:37,413 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:37,413 INFO L139 ounterexampleChecker]: Examining path program with hash -599854953, occurence #1 [2024-12-05 08:20:37,413 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:37,413 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1133481194, now seen corresponding path program 1 times [2024-12-05 08:20:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599504145] [2024-12-05 08:20:37,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:37,486 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:37,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:37,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:37,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:37,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:37,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-12-05 08:20:37,624 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:20:37,624 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:37,624 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-12-05 08:20:37,701 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-12-05 08:20:37,704 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:37,759 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:37,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:37,760 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;@7c365932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:37,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:51,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:51,013 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:51,013 INFO L139 ounterexampleChecker]: Examining path program with hash -284042991, occurence #1 [2024-12-05 08:20:51,013 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:51,013 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:51,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1162507049, now seen corresponding path program 1 times [2024-12-05 08:20:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928609824] [2024-12-05 08:20:51,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:51,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-05 08:20:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928609824] [2024-12-05 08:20:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928609824] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:20:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667749160] [2024-12-05 08:20:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:20:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:51,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:20:51,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:20:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:51,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:51,086 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-05 08:20:51,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-12-05 08:21:25,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:25,269 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:25,270 INFO L139 ounterexampleChecker]: Examining path program with hash -1645143436, occurence #1 [2024-12-05 08:21:25,270 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:25,270 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1382940427, now seen corresponding path program 1 times [2024-12-05 08:21:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202687040] [2024-12-05 08:21:25,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:25,777 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-05 08:21:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:25,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202687040] [2024-12-05 08:21:25,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202687040] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:25,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:25,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420167295] [2024-12-05 08:21:25,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:21:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:25,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:21:25,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:21:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:25,779 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:25,779 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-05 08:21:25,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:25,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:27,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-12-05 08:21:27,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:27,790 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:27,791 INFO L139 ounterexampleChecker]: Examining path program with hash -1664276774, occurence #1 [2024-12-05 08:21:27,791 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:27,791 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:27,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1508991933, now seen corresponding path program 2 times [2024-12-05 08:21:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597371788] [2024-12-05 08:21:27,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:21:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:27,885 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:21:27,885 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:21:28,586 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-05 08:21:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597371788] [2024-12-05 08:21:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597371788] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:21:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493184129] [2024-12-05 08:21:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:28,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:21:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:28,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:21:28,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:21:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:28,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 4 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-05 08:21:28,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:28,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:28,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.