./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 09:28:35,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 09:28:35,224 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-05 09:28:35,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 09:28:35,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-05 09:28:35,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 09:28:35,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-05 09:28:35,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-05 09:28:35,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-05 09:28:35,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * Use SBE=true [2024-12-05 09:28:35,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 09:28:35,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 09:28:35,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-05 09:28:35,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 09:28:35,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-05 09:28:35,253 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-05 09:28:35,253 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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2024-12-05 09:28:35,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 09:28:35,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 09:28:35,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 09:28:35,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 09:28:35,507 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 09:28:35,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/../../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-12-05 09:28:38,251 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/data/ffa37b20b/33c26eeedb67453a8505afa5cb48bfaa/FLAG3e0425821 [2024-12-05 09:28:38,492 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 09:28:38,492 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-12-05 09:28:38,505 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/data/ffa37b20b/33c26eeedb67453a8505afa5cb48bfaa/FLAG3e0425821 [2024-12-05 09:28:38,519 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/data/ffa37b20b/33c26eeedb67453a8505afa5cb48bfaa [2024-12-05 09:28:38,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 09:28:38,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 09:28:38,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 09:28:38,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 09:28:38,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 09:28:38,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:28:38" (1/1) ... [2024-12-05 09:28:38,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342e2b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:38, skipping insertion in model container [2024-12-05 09:28:38,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:28:38" (1/1) ... [2024-12-05 09:28:38,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 09:28:38,880 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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i[30176,30189] [2024-12-05 09:28:38,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 09:28:38,929 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 09:28:38,964 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_c11eb6d4-e354-4e88-a80a-ca4038ebd601/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i[30176,30189] [2024-12-05 09:28:38,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 09:28:39,007 INFO L204 MainTranslator]: Completed translation [2024-12-05 09:28:39,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39 WrapperNode [2024-12-05 09:28:39,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 09:28:39,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 09:28:39,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 09:28:39,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 09:28:39,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,041 INFO L138 Inliner]: procedures = 171, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-12-05 09:28:39,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 09:28:39,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 09:28:39,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 09:28:39,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 09:28:39,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 09:28:39,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 09:28:39,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 09:28:39,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 09:28:39,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (1/1) ... [2024-12-05 09:28:39,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 09:28:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 09:28:39,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-05 09:28:39,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 09:28:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-05 09:28:39,127 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-05 09:28:39,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 09:28:39,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 09:28:39,127 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-05 09:28:39,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 09:28:39,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 09:28:39,128 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 09:28:39,232 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 09:28:39,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 09:28:39,415 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-05 09:28:39,415 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 09:28:39,570 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 09:28:39,570 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-12-05 09:28:39,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:28:39 BoogieIcfgContainer [2024-12-05 09:28:39,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 09:28:39,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-05 09:28:39,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-05 09:28:39,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-05 09:28:39,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:28:38" (1/3) ... [2024-12-05 09:28:39,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f6805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:28:39, skipping insertion in model container [2024-12-05 09:28:39,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:28:39" (2/3) ... [2024-12-05 09:28:39,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f6805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:28:39, skipping insertion in model container [2024-12-05 09:28:39,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:28:39" (3/3) ... [2024-12-05 09:28:39,579 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2024-12-05 09:28:39,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-05 09:28:39,594 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 39 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-12-05 09:28:39,595 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-05 09:28:39,633 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-05 09:28:39,681 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-05 09:28:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 09:28:39,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-05 09:28:39,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c11eb6d4-e354-4e88-a80a-ca4038ebd601/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-05 09:28:39,753 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:39,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:39,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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:39,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:39,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:39,986 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:39,986 INFO L139 ounterexampleChecker]: Examining path program with hash 495902507, occurence #1 [2024-12-05 09:28:39,986 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:39,986 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash -257969519, now seen corresponding path program 1 times [2024-12-05 09:28:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272492696] [2024-12-05 09:28:39,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:40,156 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 09:28:40,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272492696] [2024-12-05 09:28:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272492696] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:40,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380580635] [2024-12-05 09:28:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:40,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:40,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:40,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:40,185 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 09:28:40,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:40,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-05 09:28:40,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:40,293 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:40,293 INFO L139 ounterexampleChecker]: Examining path program with hash -1382430663, occurence #1 [2024-12-05 09:28:40,293 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:40,293 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:40,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash 209787663, now seen corresponding path program 1 times [2024-12-05 09:28:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047037917] [2024-12-05 09:28:40,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:40,326 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:40,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:40,362 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:40,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:40,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:40,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-05 09:28:40,371 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-05 09:28:40,373 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:40,373 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-05 09:28:40,392 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-05 09:28:40,395 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:40,402 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:40,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:40,403 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:40,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:40,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:40,767 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:40,767 INFO L139 ounterexampleChecker]: Examining path program with hash 1159329025, occurence #1 [2024-12-05 09:28:40,767 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:40,768 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:40,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash 644816115, now seen corresponding path program 1 times [2024-12-05 09:28:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896728307] [2024-12-05 09:28:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:40,819 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 09:28:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896728307] [2024-12-05 09:28:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896728307] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425727447] [2024-12-05 09:28:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:40,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:40,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:40,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:40,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:40,821 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 09:28:40,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-05 09:28:41,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:41,313 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:41,314 INFO L139 ounterexampleChecker]: Examining path program with hash 1572022134, occurence #1 [2024-12-05 09:28:41,314 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:41,314 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 352685468, now seen corresponding path program 1 times [2024-12-05 09:28:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053707341] [2024-12-05 09:28:41,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:41,451 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 09:28:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053707341] [2024-12-05 09:28:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053707341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:28:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108209952] [2024-12-05 09:28:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:41,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:28:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:41,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:28:41,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:28:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:41,453 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 09:28:41,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:41,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-05 09:28:41,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:41,612 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:41,612 INFO L139 ounterexampleChecker]: Examining path program with hash 940341589, occurence #1 [2024-12-05 09:28:41,612 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:41,612 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1558222522, now seen corresponding path program 1 times [2024-12-05 09:28:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65487510] [2024-12-05 09:28:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:41,853 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 09:28:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65487510] [2024-12-05 09:28:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65487510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:28:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273142551] [2024-12-05 09:28:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:28:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:41,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:28:41,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:28:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,855 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:41,856 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 09:28:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:28:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-05 09:28:41,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:41,959 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:41,959 INFO L139 ounterexampleChecker]: Examining path program with hash -1750293285, occurence #1 [2024-12-05 09:28:41,959 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:41,959 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -721174811, now seen corresponding path program 1 times [2024-12-05 09:28:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899449783] [2024-12-05 09:28:41,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:41,981 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:42,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:42,002 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:42,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:42,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:42,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-05 09:28:42,004 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:28:42,005 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:42,005 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-05 09:28:42,029 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-05 09:28:42,032 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:42,041 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:42,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:42,042 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:42,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:42,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:42,563 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:42,563 INFO L139 ounterexampleChecker]: Examining path program with hash 314077016, occurence #1 [2024-12-05 09:28:42,563 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:42,563 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -557131846, now seen corresponding path program 1 times [2024-12-05 09:28:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147681047] [2024-12-05 09:28:42,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:42,603 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 09:28:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:42,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147681047] [2024-12-05 09:28:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147681047] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503232019] [2024-12-05 09:28:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:42,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:42,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:42,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:42,605 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:42,605 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 09:28:42,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-05 09:28:43,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:43,673 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:43,674 INFO L139 ounterexampleChecker]: Examining path program with hash 1027621545, occurence #1 [2024-12-05 09:28:43,674 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:43,674 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1893860358, now seen corresponding path program 1 times [2024-12-05 09:28:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518970277] [2024-12-05 09:28:43,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:43,804 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 09:28:43,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:43,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518970277] [2024-12-05 09:28:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518970277] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:43,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:28:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531658071] [2024-12-05 09:28:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:43,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:28:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:43,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:28:43,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:28:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,806 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:43,806 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 09:28:43,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-05 09:28:43,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:43,977 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:43,977 INFO L139 ounterexampleChecker]: Examining path program with hash 1146263480, occurence #1 [2024-12-05 09:28:43,977 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:43,977 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:43,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1099931017, now seen corresponding path program 1 times [2024-12-05 09:28:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797163046] [2024-12-05 09:28:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:44,180 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 09:28:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797163046] [2024-12-05 09:28:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797163046] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:28:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110604441] [2024-12-05 09:28:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:28:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:44,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:28:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:28:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:44,181 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:44,182 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 09:28:44,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:44,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:44,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:28:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-05 09:28:44,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:44,364 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:44,364 INFO L139 ounterexampleChecker]: Examining path program with hash -486618253, occurence #1 [2024-12-05 09:28:44,364 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:44,364 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1829382760, now seen corresponding path program 1 times [2024-12-05 09:28:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326804676] [2024-12-05 09:28:44,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:44,389 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:44,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:44,412 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:44,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:44,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-05 09:28:44,414 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:28:44,414 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:44,414 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-05 09:28:44,436 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-05 09:28:44,438 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:44,449 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:44,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:44,450 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:44,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:45,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:45,002 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:45,002 INFO L139 ounterexampleChecker]: Examining path program with hash -1767665139, occurence #1 [2024-12-05 09:28:45,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:45,002 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -632400131, now seen corresponding path program 1 times [2024-12-05 09:28:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974478768] [2024-12-05 09:28:45,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:45,031 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 09:28:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974478768] [2024-12-05 09:28:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974478768] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:45,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944743631] [2024-12-05 09:28:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:45,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:45,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:45,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:45,032 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:45,032 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 09:28:45,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-05 09:28:46,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:46,363 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:46,363 INFO L139 ounterexampleChecker]: Examining path program with hash -1750973289, occurence #1 [2024-12-05 09:28:46,363 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:46,363 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash -748111869, now seen corresponding path program 1 times [2024-12-05 09:28:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526973474] [2024-12-05 09:28:46,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:46,490 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 09:28:46,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526973474] [2024-12-05 09:28:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526973474] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:28:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162422984] [2024-12-05 09:28:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:46,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:28:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:46,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:28:46,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:28:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:46,492 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 09:28:46,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-05 09:28:46,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:46,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:46,718 INFO L139 ounterexampleChecker]: Examining path program with hash 1913890010, occurence #1 [2024-12-05 09:28:46,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:46,719 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:46,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1388685389, now seen corresponding path program 1 times [2024-12-05 09:28:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726327721] [2024-12-05 09:28:46,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:28:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726327721] [2024-12-05 09:28:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726327721] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:28:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644016615] [2024-12-05 09:28:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:28:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:46,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:28:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:28:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,942 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:28:46,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:46,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:46,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:28:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-05 09:28:47,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:47,190 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:47,190 INFO L139 ounterexampleChecker]: Examining path program with hash 92186880, occurence #1 [2024-12-05 09:28:47,190 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:47,190 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:47,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash 956569102, now seen corresponding path program 1 times [2024-12-05 09:28:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882235095] [2024-12-05 09:28:47,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:47,214 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:47,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:47,241 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:47,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:47,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:47,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-05 09:28:47,243 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:28:47,243 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:47,244 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-05 09:28:47,290 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-05 09:28:47,292 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:47,307 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:47,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:47,308 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:47,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:48,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:48,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:48,041 INFO L139 ounterexampleChecker]: Examining path program with hash 1683302230, occurence #1 [2024-12-05 09:28:48,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:48,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:48,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2118196885, now seen corresponding path program 1 times [2024-12-05 09:28:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:48,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728357905] [2024-12-05 09:28:48,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:48,068 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 09:28:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728357905] [2024-12-05 09:28:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728357905] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820919517] [2024-12-05 09:28:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:48,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:48,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:48,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:48,070 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:48,070 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 09:28:48,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:49,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-05 09:28:49,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:49,938 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:49,939 INFO L139 ounterexampleChecker]: Examining path program with hash 1855125912, occurence #1 [2024-12-05 09:28:49,939 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:49,939 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1376544527, now seen corresponding path program 1 times [2024-12-05 09:28:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189729937] [2024-12-05 09:28:49,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:28:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:50,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189729937] [2024-12-05 09:28:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189729937] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:50,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:50,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:28:50,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150901438] [2024-12-05 09:28:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:50,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:28:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:50,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:28:50,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:28:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,054 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:50,054 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 09:28:50,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-05 09:28:50,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:50,393 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:50,393 INFO L139 ounterexampleChecker]: Examining path program with hash 1878002649, occurence #1 [2024-12-05 09:28:50,393 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:50,393 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 933894732, now seen corresponding path program 1 times [2024-12-05 09:28:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255982042] [2024-12-05 09:28:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:50,559 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 09:28:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255982042] [2024-12-05 09:28:50,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255982042] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:50,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:50,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:28:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336380106] [2024-12-05 09:28:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:50,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:28:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:50,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:28:50,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:28:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,561 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:50,561 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 09:28:50,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:50,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:28:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-05 09:28:50,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:50,921 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:50,921 INFO L139 ounterexampleChecker]: Examining path program with hash -299761348, occurence #1 [2024-12-05 09:28:50,921 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:50,921 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:50,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 804443155, now seen corresponding path program 1 times [2024-12-05 09:28:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740772056] [2024-12-05 09:28:50,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:50,944 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:50,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:50,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:50,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:50,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:50,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-05 09:28:50,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:28:50,970 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:50,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-05 09:28:50,996 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-05 09:28:50,998 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:51,014 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:51,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:51,015 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:51,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:51,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:51,931 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:51,931 INFO L139 ounterexampleChecker]: Examining path program with hash -519597025, occurence #1 [2024-12-05 09:28:51,931 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:51,931 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:51,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2032698649, now seen corresponding path program 1 times [2024-12-05 09:28:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908382619] [2024-12-05 09:28:51,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:51,958 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 09:28:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908382619] [2024-12-05 09:28:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908382619] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:51,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862751422] [2024-12-05 09:28:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:51,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:51,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:51,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:51,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:51,960 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 09:28:51,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-05 09:28:54,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:54,399 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:54,399 INFO L139 ounterexampleChecker]: Examining path program with hash -1523013352, occurence #1 [2024-12-05 09:28:54,399 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:54,400 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -849724645, now seen corresponding path program 1 times [2024-12-05 09:28:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928965510] [2024-12-05 09:28:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:54,479 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 09:28:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928965510] [2024-12-05 09:28:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928965510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:28:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827375353] [2024-12-05 09:28:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:28:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:54,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:28:54,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:28:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:54,481 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 09:28:54,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-05 09:28:54,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:54,920 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:54,920 INFO L139 ounterexampleChecker]: Examining path program with hash 1807593992, occurence #1 [2024-12-05 09:28:54,920 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:54,920 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2102548841, now seen corresponding path program 1 times [2024-12-05 09:28:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568636737] [2024-12-05 09:28:54,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:55,140 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 09:28:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568636737] [2024-12-05 09:28:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568636737] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:28:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863993335] [2024-12-05 09:28:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:28:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:55,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:28:55,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:28:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:55,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:55,142 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 09:28:55,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:55,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:55,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:28:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:28:55,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-05 09:28:55,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:55,746 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:55,746 INFO L139 ounterexampleChecker]: Examining path program with hash -119269928, occurence #1 [2024-12-05 09:28:55,746 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:55,746 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:55,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2050926305, now seen corresponding path program 1 times [2024-12-05 09:28:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164466101] [2024-12-05 09:28:55,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:55,772 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:28:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:28:55,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:28:55,795 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:28:55,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:28:55,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:28:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-05 09:28:55,797 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:28:55,797 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:28:55,797 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-12-05 09:28:55,824 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-12-05 09:28:55,826 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:55,843 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:28:55,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:28:55,844 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:28:55,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:28:56,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:56,903 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:56,903 INFO L139 ounterexampleChecker]: Examining path program with hash 1488291209, occurence #1 [2024-12-05 09:28:56,903 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:56,903 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1934849848, now seen corresponding path program 1 times [2024-12-05 09:28:56,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:56,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838998228] [2024-12-05 09:28:56,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:28:56,921 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 09:28:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:28:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838998228] [2024-12-05 09:28:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838998228] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:28:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:28:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:28:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900104982] [2024-12-05 09:28:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:28:56,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:28:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:28:56,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:28:56,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:28:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:56,922 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:28:56,922 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 09:28:56,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:28:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-05 09:28:59,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:28:59,932 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:28:59,932 INFO L139 ounterexampleChecker]: Examining path program with hash -1843605841, occurence #1 [2024-12-05 09:28:59,932 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:28:59,932 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:28:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:28:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1369687932, now seen corresponding path program 1 times [2024-12-05 09:28:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:28:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129783150] [2024-12-05 09:28:59,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:28:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:28:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:00,039 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 09:29:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129783150] [2024-12-05 09:29:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129783150] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:00,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:00,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:00,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100071033] [2024-12-05 09:29:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:00,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:00,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:00,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,041 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:00,041 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 09:29:00,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-05 09:29:00,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:00,595 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:00,595 INFO L139 ounterexampleChecker]: Examining path program with hash 94580221, occurence #1 [2024-12-05 09:29:00,595 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:00,595 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:00,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1727816245, now seen corresponding path program 1 times [2024-12-05 09:29:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213755498] [2024-12-05 09:29:00,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:00,838 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 09:29:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213755498] [2024-12-05 09:29:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213755498] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:00,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374805758] [2024-12-05 09:29:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:00,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:00,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,840 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:00,840 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 09:29:00,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:00,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:00,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:01,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-05 09:29:01,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:01,387 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:01,387 INFO L139 ounterexampleChecker]: Examining path program with hash -1889375441, occurence #1 [2024-12-05 09:29:01,387 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:01,387 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:01,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1952275781, now seen corresponding path program 1 times [2024-12-05 09:29:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241562170] [2024-12-05 09:29:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:01,414 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:01,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:01,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:01,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:01,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:01,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-05 09:29:01,444 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:01,444 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:01,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-12-05 09:29:01,473 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-05 09:29:01,475 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:01,494 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:01,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:01,494 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:01,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:02,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:02,907 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:02,907 INFO L139 ounterexampleChecker]: Examining path program with hash -2133694520, occurence #1 [2024-12-05 09:29:02,907 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:02,907 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1906371293, now seen corresponding path program 1 times [2024-12-05 09:29:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764930564] [2024-12-05 09:29:02,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:29:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764930564] [2024-12-05 09:29:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764930564] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:02,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377075156] [2024-12-05 09:29:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:02,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:02,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:02,929 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:02,929 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 09:29:02,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:06,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-05 09:29:06,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:06,588 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:06,589 INFO L139 ounterexampleChecker]: Examining path program with hash -375433844, occurence #1 [2024-12-05 09:29:06,589 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:06,589 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:06,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:06,589 INFO L85 PathProgramCache]: Analyzing trace with hash -319230983, now seen corresponding path program 1 times [2024-12-05 09:29:06,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:06,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247868103] [2024-12-05 09:29:06,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:06,728 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 09:29:06,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:06,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247868103] [2024-12-05 09:29:06,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247868103] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:06,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682417019] [2024-12-05 09:29:06,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:06,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:06,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:06,730 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:06,730 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 09:29:06,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:06,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-05 09:29:07,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:07,333 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:07,334 INFO L139 ounterexampleChecker]: Examining path program with hash 1675026493, occurence #1 [2024-12-05 09:29:07,334 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:07,334 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1749618796, now seen corresponding path program 1 times [2024-12-05 09:29:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723425412] [2024-12-05 09:29:07,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:07,601 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 09:29:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723425412] [2024-12-05 09:29:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723425412] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960465021] [2024-12-05 09:29:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:07,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:07,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:07,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:07,603 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:07,603 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 09:29:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-05 09:29:08,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:08,384 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:08,384 INFO L139 ounterexampleChecker]: Examining path program with hash -895237469, occurence #1 [2024-12-05 09:29:08,384 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:08,384 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:08,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1922284084, now seen corresponding path program 1 times [2024-12-05 09:29:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707772163] [2024-12-05 09:29:08,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:08,411 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:08,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:08,435 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:08,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:08,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-05 09:29:08,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:08,437 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:08,437 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-12-05 09:29:08,468 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-12-05 09:29:08,471 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:08,487 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:08,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:08,487 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:08,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:09,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:09,973 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:09,973 INFO L139 ounterexampleChecker]: Examining path program with hash 1668955478, occurence #1 [2024-12-05 09:29:09,973 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:09,973 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash -558561295, now seen corresponding path program 1 times [2024-12-05 09:29:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397610642] [2024-12-05 09:29:09,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:09,996 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 09:29:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:09,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397610642] [2024-12-05 09:29:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397610642] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693131166] [2024-12-05 09:29:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:09,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:09,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:09,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:09,998 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:09,998 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 09:29:09,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-05 09:29:14,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:14,280 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:14,280 INFO L139 ounterexampleChecker]: Examining path program with hash 1736048290, occurence #1 [2024-12-05 09:29:14,280 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:14,280 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1602719329, now seen corresponding path program 1 times [2024-12-05 09:29:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90424298] [2024-12-05 09:29:14,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:14,368 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 09:29:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90424298] [2024-12-05 09:29:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90424298] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29590014] [2024-12-05 09:29:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,369 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:14,369 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 09:29:14,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:14,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-05 09:29:14,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:14,987 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:14,988 INFO L139 ounterexampleChecker]: Examining path program with hash 2064879130, occurence #1 [2024-12-05 09:29:14,988 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:14,988 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1646695506, now seen corresponding path program 1 times [2024-12-05 09:29:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:14,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861767064] [2024-12-05 09:29:14,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:15,303 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 09:29:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861767064] [2024-12-05 09:29:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861767064] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480250029] [2024-12-05 09:29:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:15,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:15,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:15,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:15,305 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 09:29:15,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:15,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:15,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:16,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-05 09:29:16,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:16,273 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:16,274 INFO L139 ounterexampleChecker]: Examining path program with hash -613264157, occurence #1 [2024-12-05 09:29:16,274 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:16,274 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:16,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1008350673, now seen corresponding path program 1 times [2024-12-05 09:29:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738826290] [2024-12-05 09:29:16,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:16,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:16,301 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:16,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:16,331 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:16,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:16,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:16,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-05 09:29:16,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:16,333 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:16,334 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-12-05 09:29:16,370 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-12-05 09:29:16,372 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:16,396 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:16,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:16,396 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:16,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:18,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:18,247 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:18,247 INFO L139 ounterexampleChecker]: Examining path program with hash 36943454, occurence #1 [2024-12-05 09:29:18,247 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:18,247 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2068134277, now seen corresponding path program 1 times [2024-12-05 09:29:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091506535] [2024-12-05 09:29:18,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:18,271 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 09:29:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091506535] [2024-12-05 09:29:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091506535] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671566196] [2024-12-05 09:29:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:18,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:18,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:18,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:18,273 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 09:29:18,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-05 09:29:23,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:23,300 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:23,300 INFO L139 ounterexampleChecker]: Examining path program with hash -168600991, occurence #1 [2024-12-05 09:29:23,300 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:23,300 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1114300922, now seen corresponding path program 1 times [2024-12-05 09:29:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663279148] [2024-12-05 09:29:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:23,399 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 09:29:23,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:23,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663279148] [2024-12-05 09:29:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663279148] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:23,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766126324] [2024-12-05 09:29:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:23,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:23,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:23,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:23,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:23,400 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 09:29:23,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:23,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:24,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-05 09:29:24,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:24,110 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:24,110 INFO L139 ounterexampleChecker]: Examining path program with hash 759574759, occurence #1 [2024-12-05 09:29:24,110 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:24,110 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2120746331, now seen corresponding path program 1 times [2024-12-05 09:29:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525452523] [2024-12-05 09:29:24,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:24,319 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 09:29:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525452523] [2024-12-05 09:29:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525452523] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:24,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138974782] [2024-12-05 09:29:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:24,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:24,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:24,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:24,320 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:24,321 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 09:29:24,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:24,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:24,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-05 09:29:25,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:25,583 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:25,583 INFO L139 ounterexampleChecker]: Examining path program with hash -1629559962, occurence #1 [2024-12-05 09:29:25,583 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:25,583 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:25,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1955035149, now seen corresponding path program 1 times [2024-12-05 09:29:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599780976] [2024-12-05 09:29:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:25,622 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:25,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:25,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:25,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:25,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-05 09:29:25,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:25,664 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:25,664 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-12-05 09:29:25,700 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-12-05 09:29:25,702 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:25,722 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:25,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:25,723 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:25,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:27,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:27,825 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:27,825 INFO L139 ounterexampleChecker]: Examining path program with hash -1548079466, occurence #1 [2024-12-05 09:29:27,825 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:27,825 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1143331110, now seen corresponding path program 1 times [2024-12-05 09:29:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409063468] [2024-12-05 09:29:27,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:27,847 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 09:29:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409063468] [2024-12-05 09:29:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409063468] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86929585] [2024-12-05 09:29:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:27,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:27,848 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:27,848 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 09:29:27,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:33,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-05 09:29:33,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:33,726 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:33,726 INFO L139 ounterexampleChecker]: Examining path program with hash 1923024397, occurence #1 [2024-12-05 09:29:33,726 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:33,726 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:33,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -65162526, now seen corresponding path program 1 times [2024-12-05 09:29:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:33,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326552266] [2024-12-05 09:29:33,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:33,843 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 09:29:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326552266] [2024-12-05 09:29:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326552266] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50883338] [2024-12-05 09:29:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:33,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:33,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:33,844 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:33,845 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 09:29:33,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:33,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:34,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-05 09:29:34,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:34,737 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:34,737 INFO L139 ounterexampleChecker]: Examining path program with hash 1006472052, occurence #1 [2024-12-05 09:29:34,737 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:34,737 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2133850858, now seen corresponding path program 1 times [2024-12-05 09:29:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947019419] [2024-12-05 09:29:34,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:34,982 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 09:29:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947019419] [2024-12-05 09:29:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947019419] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:34,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:34,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964526116] [2024-12-05 09:29:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:34,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:34,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:34,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:34,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:34,983 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 09:29:34,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:34,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:34,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:36,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-05 09:29:36,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:36,352 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:36,352 INFO L139 ounterexampleChecker]: Examining path program with hash 1388707563, occurence #1 [2024-12-05 09:29:36,352 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:36,352 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1741009300, now seen corresponding path program 1 times [2024-12-05 09:29:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829146788] [2024-12-05 09:29:36,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:36,380 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:36,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:36,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:36,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:36,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:36,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-05 09:29:36,412 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:36,412 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:36,412 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-12-05 09:29:36,445 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-12-05 09:29:36,446 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:36,474 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:36,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:36,475 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:36,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:39,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:39,047 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:39,048 INFO L139 ounterexampleChecker]: Examining path program with hash -2059502577, occurence #1 [2024-12-05 09:29:39,048 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:39,048 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:39,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1569681727, now seen corresponding path program 1 times [2024-12-05 09:29:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118744735] [2024-12-05 09:29:39,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:39,073 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 09:29:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118744735] [2024-12-05 09:29:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118744735] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027053395] [2024-12-05 09:29:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:39,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:39,074 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:39,074 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 09:29:39,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-05 09:29:45,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:45,622 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:45,622 INFO L139 ounterexampleChecker]: Examining path program with hash -465420194, occurence #1 [2024-12-05 09:29:45,622 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:45,622 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2010004071, now seen corresponding path program 1 times [2024-12-05 09:29:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517530391] [2024-12-05 09:29:45,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:45,738 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 09:29:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:45,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517530391] [2024-12-05 09:29:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517530391] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614844527] [2024-12-05 09:29:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:45,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:45,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:45,739 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:45,740 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 09:29:45,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:45,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-05 09:29:46,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:46,770 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:46,770 INFO L139 ounterexampleChecker]: Examining path program with hash 1297546620, occurence #1 [2024-12-05 09:29:46,770 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:46,770 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:46,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1333169358, now seen corresponding path program 1 times [2024-12-05 09:29:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915753907] [2024-12-05 09:29:46,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:47,070 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 09:29:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915753907] [2024-12-05 09:29:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915753907] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:47,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:29:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380081247] [2024-12-05 09:29:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:29:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:47,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:29:47,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:29:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:47,071 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:47,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:29:47,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:47,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:47,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:29:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:29:48,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-05 09:29:48,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:48,912 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:48,912 INFO L139 ounterexampleChecker]: Examining path program with hash 249967559, occurence #1 [2024-12-05 09:29:48,912 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:48,912 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:48,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1215754294, now seen corresponding path program 1 times [2024-12-05 09:29:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:48,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377207433] [2024-12-05 09:29:48,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:48,943 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:29:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:29:48,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:29:48,977 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:29:48,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:29:48,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:29:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-05 09:29:48,979 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:29:48,979 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:29:48,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-12-05 09:29:49,012 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-12-05 09:29:49,014 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:49,044 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:29:49,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:29:49,044 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:29:49,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:29:51,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:51,692 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:51,692 INFO L139 ounterexampleChecker]: Examining path program with hash -602973283, occurence #1 [2024-12-05 09:29:51,692 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:51,692 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:51,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1424096693, now seen corresponding path program 1 times [2024-12-05 09:29:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107218159] [2024-12-05 09:29:51,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:51,716 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 09:29:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107218159] [2024-12-05 09:29:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107218159] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:29:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787813737] [2024-12-05 09:29:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:29:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:29:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:29:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:51,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:51,717 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 09:29:51,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-05 09:29:59,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:29:59,858 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:29:59,858 INFO L139 ounterexampleChecker]: Examining path program with hash -1468683373, occurence #1 [2024-12-05 09:29:59,858 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:29:59,858 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:29:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:29:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1649921928, now seen corresponding path program 1 times [2024-12-05 09:29:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:29:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753974502] [2024-12-05 09:29:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:29:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:29:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:29:59,986 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 09:29:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:29:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753974502] [2024-12-05 09:29:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753974502] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:29:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:29:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:29:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364232223] [2024-12-05 09:29:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:29:59,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:29:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:29:59,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:29:59,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:29:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:59,987 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:29:59,988 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 09:29:59,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:29:59,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:01,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-05 09:30:01,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:01,029 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:01,029 INFO L139 ounterexampleChecker]: Examining path program with hash -147317627, occurence #1 [2024-12-05 09:30:01,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:01,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:01,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1190783, now seen corresponding path program 1 times [2024-12-05 09:30:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952015287] [2024-12-05 09:30:01,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:01,289 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 09:30:01,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952015287] [2024-12-05 09:30:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952015287] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:30:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048201955] [2024-12-05 09:30:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:30:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:01,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:30:01,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:30:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:01,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:01,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:30:01,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:01,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:01,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:30:03,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-05 09:30:03,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:03,213 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:03,213 INFO L139 ounterexampleChecker]: Examining path program with hash -496200549, occurence #1 [2024-12-05 09:30:03,213 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:03,213 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1971592730, now seen corresponding path program 1 times [2024-12-05 09:30:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597332575] [2024-12-05 09:30:03,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:03,246 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:30:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:03,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:30:03,293 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:30:03,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:30:03,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:30:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-05 09:30:03,294 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:30:03,294 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:30:03,294 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-12-05 09:30:03,342 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-12-05 09:30:03,345 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:03,368 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:30:03,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:30:03,368 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:03,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:30:06,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:06,657 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:06,657 INFO L139 ounterexampleChecker]: Examining path program with hash -895619084, occurence #1 [2024-12-05 09:30:06,657 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:06,657 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2002210751, now seen corresponding path program 1 times [2024-12-05 09:30:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742902962] [2024-12-05 09:30:06,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:06,683 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 09:30:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742902962] [2024-12-05 09:30:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742902962] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:06,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:30:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104394609] [2024-12-05 09:30:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:30:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:06,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:30:06,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:30:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:06,684 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:06,684 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 09:30:06,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-05 09:30:15,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:15,701 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:15,701 INFO L139 ounterexampleChecker]: Examining path program with hash 406321068, occurence #1 [2024-12-05 09:30:15,701 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:15,701 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1072122991, now seen corresponding path program 1 times [2024-12-05 09:30:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809638462] [2024-12-05 09:30:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:15,842 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 09:30:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809638462] [2024-12-05 09:30:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809638462] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:30:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263510224] [2024-12-05 09:30:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:15,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:30:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:15,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:30:15,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:30:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:15,844 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:15,844 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 09:30:15,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:15,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:17,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-05 09:30:17,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:17,046 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:17,047 INFO L139 ounterexampleChecker]: Examining path program with hash -1272006323, occurence #1 [2024-12-05 09:30:17,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:17,047 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1634501411, now seen corresponding path program 1 times [2024-12-05 09:30:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343519323] [2024-12-05 09:30:17,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:17,462 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 09:30:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343519323] [2024-12-05 09:30:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343519323] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:30:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462401836] [2024-12-05 09:30:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:17,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:30:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:17,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:30:17,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:30:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:17,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:17,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:30:17,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:17,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:17,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:30:20,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-12-05 09:30:20,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:20,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:20,041 INFO L139 ounterexampleChecker]: Examining path program with hash 487239149, occurence #1 [2024-12-05 09:30:20,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:20,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:20,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -263165209, now seen corresponding path program 1 times [2024-12-05 09:30:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:20,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804038516] [2024-12-05 09:30:20,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:20,076 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:30:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:20,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:30:20,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:30:20,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:30:20,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:30:20,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-05 09:30:20,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 09:30:20,119 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:30:20,119 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-12-05 09:30:20,170 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-12-05 09:30:20,173 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:20,208 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:30:20,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:30:20,209 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:20,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:30:23,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:23,829 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:23,829 INFO L139 ounterexampleChecker]: Examining path program with hash 1321239985, occurence #1 [2024-12-05 09:30:23,829 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:23,829 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1785265812, now seen corresponding path program 1 times [2024-12-05 09:30:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:23,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880190509] [2024-12-05 09:30:23,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:23,858 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 09:30:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:23,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880190509] [2024-12-05 09:30:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880190509] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:30:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857427298] [2024-12-05 09:30:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:23,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:30:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:23,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:30:23,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:30:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:23,859 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:23,859 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 09:30:23,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:34,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-05 09:30:34,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:34,108 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:34,108 INFO L139 ounterexampleChecker]: Examining path program with hash -795553259, occurence #1 [2024-12-05 09:30:34,108 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:34,108 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1507613296, now seen corresponding path program 1 times [2024-12-05 09:30:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172107390] [2024-12-05 09:30:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:30:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172107390] [2024-12-05 09:30:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172107390] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:30:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389606740] [2024-12-05 09:30:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:30:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:30:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:30:34,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:34,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:34,258 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 09:30:34,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:34,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-05 09:30:35,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:35,758 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:35,758 INFO L139 ounterexampleChecker]: Examining path program with hash 879566159, occurence #1 [2024-12-05 09:30:35,758 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:35,758 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash -481262924, now seen corresponding path program 2 times [2024-12-05 09:30:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320958411] [2024-12-05 09:30:35,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:30:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:35,824 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:30:35,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:30:36,093 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 09:30:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320958411] [2024-12-05 09:30:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320958411] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:30:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028405483] [2024-12-05 09:30:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:36,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:30:36,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:36,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:30:36,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:30:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:36,095 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:36,095 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 09:30:36,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:36,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:36,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:30:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-05 09:30:39,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:39,246 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:39,246 INFO L139 ounterexampleChecker]: Examining path program with hash -680626506, occurence #1 [2024-12-05 09:30:39,246 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:39,246 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash -108268306, now seen corresponding path program 1 times [2024-12-05 09:30:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020946235] [2024-12-05 09:30:39,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:39,283 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:30:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:30:39,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:30:39,336 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:30:39,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:30:39,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:30:39,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-12-05 09:30:39,338 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:30:39,338 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:30:39,338 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-12-05 09:30:39,388 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-12-05 09:30:39,391 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:39,428 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:30:39,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:30:39,429 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:30:39,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:30:43,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:43,581 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:43,581 INFO L139 ounterexampleChecker]: Examining path program with hash 1399999704, occurence #1 [2024-12-05 09:30:43,582 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:43,582 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1313437879, now seen corresponding path program 1 times [2024-12-05 09:30:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641599037] [2024-12-05 09:30:43,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:43,683 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 09:30:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641599037] [2024-12-05 09:30:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641599037] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:30:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028422047] [2024-12-05 09:30:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:30:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:30:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:30:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:43,684 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:43,685 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 09:30:43,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-05 09:30:55,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:55,340 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:55,341 INFO L139 ounterexampleChecker]: Examining path program with hash 1780257092, occurence #1 [2024-12-05 09:30:55,341 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:55,341 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1066692456, now seen corresponding path program 1 times [2024-12-05 09:30:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224825659] [2024-12-05 09:30:55,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:30:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:30:55,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 09:30:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:55,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224825659] [2024-12-05 09:30:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224825659] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:55,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:30:55,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072311887] [2024-12-05 09:30:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:55,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:30:55,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:55,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:30:55,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:30:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:55,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:55,588 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 09:30:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:56,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-12-05 09:30:56,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:30:56,943 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:30:56,943 INFO L139 ounterexampleChecker]: Examining path program with hash -365332712, occurence #1 [2024-12-05 09:30:56,944 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:30:56,944 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:30:56,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:30:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 878149890, now seen corresponding path program 2 times [2024-12-05 09:30:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:30:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841050415] [2024-12-05 09:30:56,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:30:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:30:57,013 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:30:57,013 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:30:57,299 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 09:30:57,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:30:57,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841050415] [2024-12-05 09:30:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841050415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:30:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:30:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:30:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531017516] [2024-12-05 09:30:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:30:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:30:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:30:57,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:30:57,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:30:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:57,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:30:57,301 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 09:30:57,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:30:57,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:30:57,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:31:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-12-05 09:31:00,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:00,796 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:00,796 INFO L139 ounterexampleChecker]: Examining path program with hash 1542858858, occurence #1 [2024-12-05 09:31:00,796 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:00,796 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -334119281, now seen corresponding path program 1 times [2024-12-05 09:31:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977431650] [2024-12-05 09:31:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:00,837 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:31:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:00,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:31:00,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:31:00,920 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:31:00,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:31:00,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-12-05 09:31:00,921 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:31:00,922 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:31:00,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-12-05 09:31:00,973 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-12-05 09:31:00,976 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:01,006 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:31:01,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:31:01,007 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:01,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:31:05,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:05,756 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:05,756 INFO L139 ounterexampleChecker]: Examining path program with hash 1318738993, occurence #1 [2024-12-05 09:31:05,756 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:05,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash 406135245, now seen corresponding path program 1 times [2024-12-05 09:31:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96258503] [2024-12-05 09:31:05,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:31:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:31:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96258503] [2024-12-05 09:31:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96258503] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:31:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860314997] [2024-12-05 09:31:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:31:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:05,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:31:05,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:31:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:05,796 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:05,796 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 09:31:05,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:18,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-12-05 09:31:18,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:18,969 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:18,969 INFO L139 ounterexampleChecker]: Examining path program with hash 708989467, occurence #1 [2024-12-05 09:31:18,969 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:18,969 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1720499723, now seen corresponding path program 1 times [2024-12-05 09:31:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750319444] [2024-12-05 09:31:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:31:19,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 09:31:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750319444] [2024-12-05 09:31:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750319444] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:19,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:19,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:31:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903259517] [2024-12-05 09:31:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:19,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:31:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:19,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:31:19,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:19,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:19,142 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 09:31:19,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:19,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:20,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-12-05 09:31:20,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:20,602 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:20,602 INFO L139 ounterexampleChecker]: Examining path program with hash 2088940245, occurence #1 [2024-12-05 09:31:20,602 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:20,602 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:20,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2144748411, now seen corresponding path program 2 times [2024-12-05 09:31:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728896037] [2024-12-05 09:31:20,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:31:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:20,673 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:31:20,673 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:31:21,047 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 09:31:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:21,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728896037] [2024-12-05 09:31:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728896037] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:21,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:31:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436620964] [2024-12-05 09:31:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:31:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:21,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:31:21,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:31:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:21,048 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:21,049 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 09:31:21,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:21,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:21,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:31:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-12-05 09:31:25,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:25,240 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:25,240 INFO L139 ounterexampleChecker]: Examining path program with hash -326454763, occurence #1 [2024-12-05 09:31:25,240 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:25,240 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash 215853487, now seen corresponding path program 1 times [2024-12-05 09:31:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270522360] [2024-12-05 09:31:25,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:25,283 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:31:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:25,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:31:25,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:31:25,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:31:25,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:31:25,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-12-05 09:31:25,340 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:31:25,341 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:31:25,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-12-05 09:31:25,396 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-12-05 09:31:25,399 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:25,440 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:31:25,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:31:25,441 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:25,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:31:30,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:30,618 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:30,619 INFO L139 ounterexampleChecker]: Examining path program with hash 2076691525, occurence #1 [2024-12-05 09:31:30,619 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:30,619 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:30,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash -493746475, now seen corresponding path program 1 times [2024-12-05 09:31:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:30,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214077524] [2024-12-05 09:31:30,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:31:30,652 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 09:31:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214077524] [2024-12-05 09:31:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214077524] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:31:30,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130053862] [2024-12-05 09:31:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:31:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:30,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:31:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:31:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:30,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:30,653 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 09:31:30,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:45,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-12-05 09:31:45,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:45,071 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:45,071 INFO L139 ounterexampleChecker]: Examining path program with hash 1249881418, occurence #1 [2024-12-05 09:31:45,071 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:45,071 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1977743819, now seen corresponding path program 1 times [2024-12-05 09:31:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994964226] [2024-12-05 09:31:45,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:31:45,249 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 09:31:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994964226] [2024-12-05 09:31:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994964226] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:45,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:31:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979471554] [2024-12-05 09:31:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:31:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:45,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:31:45,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:31:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:45,251 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:45,251 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 09:31:45,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:45,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-12-05 09:31:46,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:46,737 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:46,737 INFO L139 ounterexampleChecker]: Examining path program with hash -1517275376, occurence #1 [2024-12-05 09:31:46,737 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:46,737 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 367452647, now seen corresponding path program 2 times [2024-12-05 09:31:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523195721] [2024-12-05 09:31:46,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:31:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:46,812 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:31:46,812 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:31:47,136 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 09:31:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523195721] [2024-12-05 09:31:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523195721] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:31:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445588801] [2024-12-05 09:31:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:31:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:47,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:31:47,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:31:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:47,137 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:47,138 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 09:31:47,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:47,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:47,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:31:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:31:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-12-05 09:31:52,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:52,024 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:52,025 INFO L139 ounterexampleChecker]: Examining path program with hash -335975414, occurence #1 [2024-12-05 09:31:52,025 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:52,025 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1566096593, now seen corresponding path program 1 times [2024-12-05 09:31:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291777950] [2024-12-05 09:31:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:52,068 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:31:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:31:52,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:31:52,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:31:52,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:31:52,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:31:52,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-12-05 09:31:52,146 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:31:52,146 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:31:52,146 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-12-05 09:31:52,203 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-12-05 09:31:52,207 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:52,242 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:31:52,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:31:52,242 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:31:52,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:31:57,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:31:57,911 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:31:57,911 INFO L139 ounterexampleChecker]: Examining path program with hash -1975856062, occurence #1 [2024-12-05 09:31:57,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:31:57,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:31:57,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:31:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -499369902, now seen corresponding path program 1 times [2024-12-05 09:31:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:31:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981105229] [2024-12-05 09:31:57,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:31:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:31:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:31:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:31:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:31:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981105229] [2024-12-05 09:31:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981105229] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:31:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:31:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:31:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577435561] [2024-12-05 09:31:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:31:57,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:31:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:31:57,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:31:57,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:31:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:31:57,956 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:31:57,956 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 09:31:57,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:14,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-12-05 09:32:14,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:14,013 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:14,013 INFO L139 ounterexampleChecker]: Examining path program with hash 237236131, occurence #1 [2024-12-05 09:32:14,013 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:14,013 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:14,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 569655055, now seen corresponding path program 1 times [2024-12-05 09:32:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:14,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302698380] [2024-12-05 09:32:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:32:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:32:14,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 09:32:14,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:32:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302698380] [2024-12-05 09:32:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302698380] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:32:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:32:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:32:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865606549] [2024-12-05 09:32:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:32:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:32:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:32:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:32:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:32:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:14,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:32:14,232 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 09:32:14,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:14,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:15,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-12-05 09:32:15,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:15,728 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:15,728 INFO L139 ounterexampleChecker]: Examining path program with hash -701532106, occurence #1 [2024-12-05 09:32:15,728 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:15,728 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -302788223, now seen corresponding path program 2 times [2024-12-05 09:32:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841559150] [2024-12-05 09:32:15,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:32:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:15,811 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:32:15,811 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:32:16,218 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 09:32:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:32:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841559150] [2024-12-05 09:32:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841559150] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:32:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:32:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:32:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154583678] [2024-12-05 09:32:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:32:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:32:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:32:16,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:32:16,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:32:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:16,220 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:32:16,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:32:16,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:16,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:16,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:32:21,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-12-05 09:32:21,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:21,320 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:21,320 INFO L139 ounterexampleChecker]: Examining path program with hash 1586578450, occurence #1 [2024-12-05 09:32:21,320 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:21,320 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:21,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1373454182, now seen corresponding path program 1 times [2024-12-05 09:32:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780069522] [2024-12-05 09:32:21,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:32:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:32:21,365 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:32:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:32:21,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:32:21,427 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:32:21,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:32:21,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:32:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-12-05 09:32:21,428 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:32:21,428 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:32:21,428 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-12-05 09:32:21,491 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-12-05 09:32:21,495 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:32:21,536 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:32:21,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:32:21,537 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:32:21,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:32:27,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:27,578 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:27,578 INFO L139 ounterexampleChecker]: Examining path program with hash -1247624351, occurence #1 [2024-12-05 09:32:27,578 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:27,578 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1305543163, now seen corresponding path program 1 times [2024-12-05 09:32:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429818805] [2024-12-05 09:32:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:32:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:32:27,617 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 09:32:27,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:32:27,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429818805] [2024-12-05 09:32:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429818805] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:32:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:32:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:32:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528522225] [2024-12-05 09:32:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:32:27,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:32:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:32:27,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:32:27,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:32:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:27,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:32:27,618 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 09:32:27,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:44,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-12-05 09:32:44,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:44,880 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:44,881 INFO L139 ounterexampleChecker]: Examining path program with hash 1872747000, occurence #1 [2024-12-05 09:32:44,881 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:44,881 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1644086760, now seen corresponding path program 1 times [2024-12-05 09:32:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:44,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522525075] [2024-12-05 09:32:44,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:32:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:32:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:32:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:32:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522525075] [2024-12-05 09:32:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522525075] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:32:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:32:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:32:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908559674] [2024-12-05 09:32:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:32:45,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:32:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:32:45,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:32:45,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:32:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:45,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:32:45,090 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 09:32:45,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:45,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:46,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-12-05 09:32:46,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:46,603 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:46,603 INFO L139 ounterexampleChecker]: Examining path program with hash -1769756379, occurence #1 [2024-12-05 09:32:46,603 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:46,603 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 878869174, now seen corresponding path program 2 times [2024-12-05 09:32:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195344379] [2024-12-05 09:32:46,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:32:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:46,693 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:32:46,693 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:32:47,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 09:32:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:32:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195344379] [2024-12-05 09:32:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195344379] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:32:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:32:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:32:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701381690] [2024-12-05 09:32:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:32:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:32:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:32:47,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:32:47,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:32:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:47,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:32:47,143 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 09:32:47,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:47,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:47,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:32:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:32:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:32:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-12-05 09:32:53,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:32:53,286 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:32:53,286 INFO L139 ounterexampleChecker]: Examining path program with hash 578869267, occurence #1 [2024-12-05 09:32:53,286 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:32:53,286 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:32:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:32:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash -235825256, now seen corresponding path program 1 times [2024-12-05 09:32:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:32:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663302316] [2024-12-05 09:32:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:32:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:32:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:32:53,340 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:32:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:32:53,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:32:53,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:32:53,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:32:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:32:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-12-05 09:32:53,410 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:32:53,410 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:32:53,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-12-05 09:32:53,463 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-12-05 09:32:53,466 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:32:53,503 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:32:53,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:32:53,503 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:32:53,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:33:00,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:00,229 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:00,229 INFO L139 ounterexampleChecker]: Examining path program with hash 1237872529, occurence #1 [2024-12-05 09:33:00,229 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:00,229 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1503702347, now seen corresponding path program 1 times [2024-12-05 09:33:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145741957] [2024-12-05 09:33:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:33:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:33:00,272 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 09:33:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:33:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145741957] [2024-12-05 09:33:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145741957] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:33:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:33:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:33:00,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280837607] [2024-12-05 09:33:00,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:33:00,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:33:00,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:33:00,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:33:00,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:33:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:00,274 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:33:00,274 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 09:33:00,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:19,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-12-05 09:33:19,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:19,520 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:19,521 INFO L139 ounterexampleChecker]: Examining path program with hash -1550472340, occurence #1 [2024-12-05 09:33:19,521 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:19,521 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:19,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -14727420, now seen corresponding path program 1 times [2024-12-05 09:33:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400409535] [2024-12-05 09:33:19,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:33:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:33:19,741 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 09:33:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:33:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400409535] [2024-12-05 09:33:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400409535] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:33:19,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:33:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:33:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407399108] [2024-12-05 09:33:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:33:19,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:33:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:33:19,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:33:19,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:33:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:19,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:33:19,742 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 09:33:19,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:19,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:33:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-12-05 09:33:21,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:21,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:21,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1803415503, occurence #1 [2024-12-05 09:33:21,404 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:21,404 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:21,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1738394156, now seen corresponding path program 2 times [2024-12-05 09:33:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376256172] [2024-12-05 09:33:21,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:33:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:21,500 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:33:21,500 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:33:21,881 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 09:33:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:33:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376256172] [2024-12-05 09:33:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376256172] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:33:21,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:33:21,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:33:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626464403] [2024-12-05 09:33:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:33:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:33:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:33:21,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:33:21,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:33:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:21,882 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:33:21,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 09:33:21,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:21,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:33:21,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:33:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:33:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-12-05 09:33:28,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:28,607 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:28,607 INFO L139 ounterexampleChecker]: Examining path program with hash -1715834735, occurence #1 [2024-12-05 09:33:28,607 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:28,607 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 250022523, now seen corresponding path program 1 times [2024-12-05 09:33:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296103937] [2024-12-05 09:33:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:33:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:33:28,666 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:33:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:33:28,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:33:28,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:33:28,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:33:28,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:33:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-12-05 09:33:28,746 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:33:28,747 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:33:28,747 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-12-05 09:33:28,811 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-12-05 09:33:28,814 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:33:28,863 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:33:28,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:33:28,864 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:33:28,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:33:36,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:36,327 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:36,327 INFO L139 ounterexampleChecker]: Examining path program with hash 1345851426, occurence #1 [2024-12-05 09:33:36,327 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:36,327 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:36,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2047828533, now seen corresponding path program 1 times [2024-12-05 09:33:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214978876] [2024-12-05 09:33:36,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:33:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:33:36,372 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 09:33:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:33:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214978876] [2024-12-05 09:33:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214978876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:33:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:33:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:33:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068098188] [2024-12-05 09:33:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:33:36,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:33:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:33:36,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:33:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:33:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:36,373 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:33:36,373 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 09:33:36,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:57,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-12-05 09:33:57,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:57,789 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:57,789 INFO L139 ounterexampleChecker]: Examining path program with hash 287257576, occurence #1 [2024-12-05 09:33:57,789 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:57,789 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:57,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1385592338, now seen corresponding path program 1 times [2024-12-05 09:33:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477684804] [2024-12-05 09:33:57,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:33:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:33:58,028 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 09:33:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:33:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477684804] [2024-12-05 09:33:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477684804] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:33:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:33:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:33:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101417104] [2024-12-05 09:33:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:33:58,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:33:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:33:58,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:33:58,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:33:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:58,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:33:58,029 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 09:33:58,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:58,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:33:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:33:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-12-05 09:33:59,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:33:59,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:33:59,819 INFO L139 ounterexampleChecker]: Examining path program with hash -128020404, occurence #1 [2024-12-05 09:33:59,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:33:59,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:33:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:33:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 928585536, now seen corresponding path program 2 times [2024-12-05 09:33:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:33:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961854732] [2024-12-05 09:33:59,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:33:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:33:59,939 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:33:59,939 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:34:00,472 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 09:34:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:34:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961854732] [2024-12-05 09:34:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961854732] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:34:00,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:34:00,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:34:00,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672689120] [2024-12-05 09:34:00,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:34:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:34:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:34:00,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:34:00,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:34:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:00,474 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:34:00,474 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 09:34:00,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:00,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:34:00,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:34:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:34:07,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-12-05 09:34:07,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:07,536 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:07,537 INFO L139 ounterexampleChecker]: Examining path program with hash 2101473299, occurence #1 [2024-12-05 09:34:07,537 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:07,537 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1723633039, now seen corresponding path program 1 times [2024-12-05 09:34:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:07,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118628590] [2024-12-05 09:34:07,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:34:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:34:07,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:34:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:34:07,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:34:07,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:34:07,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:34:07,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:34:07,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-12-05 09:34:07,779 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:34:07,779 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:34:07,779 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-12-05 09:34:07,848 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-12-05 09:34:07,852 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:34:07,903 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:34:07,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:34:07,904 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:34:07,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:34:15,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:15,991 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:15,991 INFO L139 ounterexampleChecker]: Examining path program with hash -1125283333, occurence #1 [2024-12-05 09:34:15,991 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:15,991 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:15,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1229972552, now seen corresponding path program 1 times [2024-12-05 09:34:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848400384] [2024-12-05 09:34:15,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:34:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:34:16,041 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 09:34:16,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:34:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848400384] [2024-12-05 09:34:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848400384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:34:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:34:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:34:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558697785] [2024-12-05 09:34:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:34:16,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:34:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:34:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:34:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:34:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:16,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:34:16,042 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 09:34:16,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-12-05 09:34:38,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:38,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:38,917 INFO L139 ounterexampleChecker]: Examining path program with hash -1422768636, occurence #1 [2024-12-05 09:34:38,917 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:38,917 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1044031943, now seen corresponding path program 1 times [2024-12-05 09:34:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131008617] [2024-12-05 09:34:38,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:34:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:34:39,360 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 09:34:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:34:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131008617] [2024-12-05 09:34:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131008617] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:34:39,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:34:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:34:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361115732] [2024-12-05 09:34:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:34:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:34:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:34:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:34:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:34:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:39,362 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:34:39,362 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 09:34:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:34:41,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-12-05 09:34:41,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:41,142 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:41,142 INFO L139 ounterexampleChecker]: Examining path program with hash -1617611462, occurence #1 [2024-12-05 09:34:41,142 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:41,142 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash 279009083, now seen corresponding path program 2 times [2024-12-05 09:34:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267436832] [2024-12-05 09:34:41,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:34:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:41,263 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:34:41,263 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:34:41,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 09:34:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:34:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267436832] [2024-12-05 09:34:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267436832] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:34:41,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:34:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:34:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921464551] [2024-12-05 09:34:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:34:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:34:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:34:41,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:34:41,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:34:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:41,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:34:41,710 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 09:34:41,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:41,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:34:41,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:34:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:34:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-12-05 09:34:49,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:49,809 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:49,809 INFO L139 ounterexampleChecker]: Examining path program with hash -210106166, occurence #1 [2024-12-05 09:34:49,809 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:49,809 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -767392600, now seen corresponding path program 1 times [2024-12-05 09:34:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633841103] [2024-12-05 09:34:49,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:34:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:34:49,890 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:34:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:34:50,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:34:50,064 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:34:50,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:34:50,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:34:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-12-05 09:34:50,066 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:34:50,066 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:34:50,066 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-12-05 09:34:50,138 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-12-05 09:34:50,141 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:34:50,206 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:34:50,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:34:50,206 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:34:50,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:34:58,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:34:58,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:34:58,718 INFO L139 ounterexampleChecker]: Examining path program with hash -1166708816, occurence #1 [2024-12-05 09:34:58,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:34:58,718 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:34:58,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:34:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash -330940495, now seen corresponding path program 1 times [2024-12-05 09:34:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:34:58,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000439510] [2024-12-05 09:34:58,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:34:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:34:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:34:58,809 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 09:34:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:34:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000439510] [2024-12-05 09:34:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000439510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:34:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:34:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:34:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731064163] [2024-12-05 09:34:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:34:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:34:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:34:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:34:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:34:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:34:58,810 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:34:58,810 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 09:34:58,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-12-05 09:35:23,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:35:23,884 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:35:23,885 INFO L139 ounterexampleChecker]: Examining path program with hash 742697305, occurence #1 [2024-12-05 09:35:23,885 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:35:23,885 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:35:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:35:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1736273511, now seen corresponding path program 1 times [2024-12-05 09:35:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:35:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605668177] [2024-12-05 09:35:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:35:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:35:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:35:24,257 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 09:35:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:35:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605668177] [2024-12-05 09:35:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605668177] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:35:24,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:35:24,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:35:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663760884] [2024-12-05 09:35:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:35:24,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:35:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:35:24,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:35:24,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:35:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:24,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:35:24,259 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 09:35:24,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:24,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:35:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-12-05 09:35:25,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:35:25,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:35:25,926 INFO L139 ounterexampleChecker]: Examining path program with hash -1400795080, occurence #1 [2024-12-05 09:35:25,926 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:35:25,926 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:35:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:35:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1744414519, now seen corresponding path program 2 times [2024-12-05 09:35:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:35:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645564447] [2024-12-05 09:35:25,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:35:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:35:26,041 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:35:26,041 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:35:26,495 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 09:35:26,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:35:26,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645564447] [2024-12-05 09:35:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645564447] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:35:26,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:35:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:35:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011038960] [2024-12-05 09:35:26,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:35:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:35:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:35:26,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:35:26,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:35:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:26,497 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:35:26,498 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 09:35:26,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:26,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:35:26,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:35:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:35:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-12-05 09:35:35,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:35:35,566 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:35:35,566 INFO L139 ounterexampleChecker]: Examining path program with hash 1224524519, occurence #1 [2024-12-05 09:35:35,566 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:35:35,566 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:35:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:35:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1810288172, now seen corresponding path program 1 times [2024-12-05 09:35:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:35:35,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128495870] [2024-12-05 09:35:35,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:35:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:35:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:35:35,652 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:35:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:35:35,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:35:35,760 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:35:35,760 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:35:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:35:35,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-12-05 09:35:35,762 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:35:35,762 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:35:35,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-12-05 09:35:35,823 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-12-05 09:35:35,826 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:35:35,871 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:35:35,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:35:35,872 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:35:35,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:35:45,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:35:45,316 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:35:45,316 INFO L139 ounterexampleChecker]: Examining path program with hash 1541183501, occurence #1 [2024-12-05 09:35:45,316 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:35:45,316 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:35:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:35:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash -162416647, now seen corresponding path program 1 times [2024-12-05 09:35:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:35:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214755795] [2024-12-05 09:35:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:35:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:35:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:35:45,479 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 09:35:45,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:35:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214755795] [2024-12-05 09:35:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214755795] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:35:45,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:35:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:35:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743696302] [2024-12-05 09:35:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:35:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:35:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:35:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:35:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:35:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:35:45,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:35:45,481 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 09:35:45,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:12,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-12-05 09:36:12,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:36:12,470 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:36:12,470 INFO L139 ounterexampleChecker]: Examining path program with hash 1754024781, occurence #1 [2024-12-05 09:36:12,470 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:36:12,470 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:36:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:36:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash -900938025, now seen corresponding path program 1 times [2024-12-05 09:36:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:36:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108620243] [2024-12-05 09:36:12,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:36:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:36:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:36:12,817 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 09:36:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:36:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108620243] [2024-12-05 09:36:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108620243] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:36:12,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:36:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:36:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619683341] [2024-12-05 09:36:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:36:12,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:36:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:36:12,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:36:12,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:36:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:12,818 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:36:12,818 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 09:36:12,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:12,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:36:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-12-05 09:36:14,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:36:14,633 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:36:14,634 INFO L139 ounterexampleChecker]: Examining path program with hash 2097860072, occurence #1 [2024-12-05 09:36:14,634 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:36:14,634 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:36:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:36:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1099922983, now seen corresponding path program 2 times [2024-12-05 09:36:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:36:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223212208] [2024-12-05 09:36:14,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:36:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:36:14,763 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:36:14,763 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:36:15,355 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 09:36:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:36:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223212208] [2024-12-05 09:36:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223212208] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:36:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:36:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:36:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281315240] [2024-12-05 09:36:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:36:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:36:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:36:15,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:36:15,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:36:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:15,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:36:15,356 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 09:36:15,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:15,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:36:15,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:36:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:36:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-12-05 09:36:24,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:36:24,800 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:36:24,801 INFO L139 ounterexampleChecker]: Examining path program with hash 1444835393, occurence #1 [2024-12-05 09:36:24,801 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:36:24,801 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:36:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:36:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1567710670, now seen corresponding path program 1 times [2024-12-05 09:36:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:36:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446794980] [2024-12-05 09:36:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:36:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:36:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:36:24,870 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:36:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:36:24,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:36:24,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:36:24,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:36:24,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:36:24,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-12-05 09:36:24,981 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:36:24,981 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:36:24,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-12-05 09:36:25,046 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-12-05 09:36:25,049 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:36:25,107 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:36:25,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:36:25,108 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:36:25,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:36:35,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:36:35,400 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:36:35,400 INFO L139 ounterexampleChecker]: Examining path program with hash 701726820, occurence #1 [2024-12-05 09:36:35,400 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:36:35,400 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:36:35,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:36:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1405349307, now seen corresponding path program 1 times [2024-12-05 09:36:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:36:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468149228] [2024-12-05 09:36:35,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:36:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:36:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:36:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:36:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:36:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468149228] [2024-12-05 09:36:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468149228] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:36:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:36:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:36:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963155937] [2024-12-05 09:36:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:36:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:36:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:36:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:36:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:36:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:36:35,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:36:35,457 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 09:36:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:04,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-12-05 09:37:04,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:37:04,845 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:37:04,845 INFO L139 ounterexampleChecker]: Examining path program with hash 1058643737, occurence #1 [2024-12-05 09:37:04,845 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:37:04,845 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:37:04,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:37:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 227266060, now seen corresponding path program 1 times [2024-12-05 09:37:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:37:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156446184] [2024-12-05 09:37:04,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:37:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:37:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:37:05,241 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 09:37:05,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:37:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156446184] [2024-12-05 09:37:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156446184] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:37:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:37:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:37:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452315064] [2024-12-05 09:37:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:37:05,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:37:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:37:05,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:37:05,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:37:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:05,243 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:37:05,243 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 09:37:05,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:05,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:37:07,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-12-05 09:37:07,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:37:07,100 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:37:07,101 INFO L139 ounterexampleChecker]: Examining path program with hash -1025310122, occurence #1 [2024-12-05 09:37:07,101 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:37:07,101 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:37:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:37:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -244072772, now seen corresponding path program 2 times [2024-12-05 09:37:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:37:07,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513766198] [2024-12-05 09:37:07,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:37:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:37:07,231 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:37:07,231 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:37:07,720 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 09:37:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:37:07,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513766198] [2024-12-05 09:37:07,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513766198] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:37:07,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:37:07,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:37:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005717537] [2024-12-05 09:37:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:37:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:37:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:37:07,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:37:07,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:37:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:07,721 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:37:07,721 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 09:37:07,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:07,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:37:07,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:37:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:37:18,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-12-05 09:37:18,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:37:18,078 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:37:18,078 INFO L139 ounterexampleChecker]: Examining path program with hash -836925976, occurence #1 [2024-12-05 09:37:18,079 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:37:18,079 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:37:18,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:37:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1939802343, now seen corresponding path program 1 times [2024-12-05 09:37:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:37:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273407362] [2024-12-05 09:37:18,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:37:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:37:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:37:18,154 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:37:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:37:18,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:37:18,269 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:37:18,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:37:18,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:37:18,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-12-05 09:37:18,271 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:37:18,271 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:37:18,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-12-05 09:37:18,335 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-12-05 09:37:18,339 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:37:18,385 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:37:18,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:37:18,385 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:37:18,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:37:29,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:37:29,172 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:37:29,172 INFO L139 ounterexampleChecker]: Examining path program with hash -1286183880, occurence #1 [2024-12-05 09:37:29,172 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:37:29,172 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:37:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:37:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1619311090, now seen corresponding path program 1 times [2024-12-05 09:37:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:37:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721647737] [2024-12-05 09:37:29,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:37:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:37:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:37:29,231 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 09:37:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:37:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721647737] [2024-12-05 09:37:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721647737] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:37:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:37:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:37:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561838157] [2024-12-05 09:37:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:37:29,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:37:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:37:29,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:37:29,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:37:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:37:29,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:37:29,232 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 09:37:29,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-12-05 09:38:00,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:38:00,369 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:38:00,369 INFO L139 ounterexampleChecker]: Examining path program with hash 823687838, occurence #1 [2024-12-05 09:38:00,369 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:38:00,369 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:38:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:38:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 269563744, now seen corresponding path program 1 times [2024-12-05 09:38:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:38:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523511531] [2024-12-05 09:38:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:38:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:38:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:38:00,674 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 09:38:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:38:00,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523511531] [2024-12-05 09:38:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523511531] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:38:00,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:38:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:38:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314110853] [2024-12-05 09:38:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:38:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:38:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:38:00,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:38:00,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:38:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:00,676 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:38:00,676 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 09:38:00,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:00,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:38:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-12-05 09:38:02,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:38:02,655 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:38:02,655 INFO L139 ounterexampleChecker]: Examining path program with hash -1489486898, occurence #1 [2024-12-05 09:38:02,656 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:38:02,656 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:38:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:38:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1180628004, now seen corresponding path program 2 times [2024-12-05 09:38:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:38:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67293267] [2024-12-05 09:38:02,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:38:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:38:02,794 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:38:02,794 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:38:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:38:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:38:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67293267] [2024-12-05 09:38:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67293267] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:38:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:38:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:38:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74848181] [2024-12-05 09:38:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:38:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:38:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:38:03,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:38:03,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:38:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:03,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:38:03,304 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 09:38:03,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:03,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:38:03,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:38:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:38:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-12-05 09:38:15,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:38:15,097 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:38:15,097 INFO L139 ounterexampleChecker]: Examining path program with hash 642101781, occurence #1 [2024-12-05 09:38:15,097 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:38:15,097 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:38:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:38:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash -553081476, now seen corresponding path program 1 times [2024-12-05 09:38:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:38:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152024563] [2024-12-05 09:38:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:38:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:38:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:38:15,176 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:38:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:38:15,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:38:15,304 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:38:15,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:38:15,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:38:15,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-12-05 09:38:15,306 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:38:15,306 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:38:15,306 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-12-05 09:38:15,382 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-12-05 09:38:15,387 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:38:15,437 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:38:15,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:38:15,438 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:38:15,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:38:27,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:38:27,011 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:38:27,011 INFO L139 ounterexampleChecker]: Examining path program with hash 900292377, occurence #1 [2024-12-05 09:38:27,011 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:38:27,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:38:27,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:38:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1050281363, now seen corresponding path program 1 times [2024-12-05 09:38:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:38:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834457385] [2024-12-05 09:38:27,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:38:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:38:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:38:27,071 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 09:38:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:38:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834457385] [2024-12-05 09:38:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834457385] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:38:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:38:27,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:38:27,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713162483] [2024-12-05 09:38:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:38:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:38:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:38:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:38:27,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:38:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:38:27,072 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:38:27,072 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 09:38:27,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-12-05 09:39:00,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:39:00,924 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:39:00,924 INFO L139 ounterexampleChecker]: Examining path program with hash -1652264686, occurence #1 [2024-12-05 09:39:00,924 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:39:00,924 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:39:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:39:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 170340455, now seen corresponding path program 1 times [2024-12-05 09:39:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:39:00,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134733649] [2024-12-05 09:39:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:39:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:39:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:39:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 09:39:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:39:01,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134733649] [2024-12-05 09:39:01,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134733649] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:39:01,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:39:01,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:39:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257821811] [2024-12-05 09:39:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:39:01,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:39:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:39:01,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:39:01,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:39:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:01,246 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:39:01,246 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 09:39:01,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:01,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:39:02,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-12-05 09:39:02,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:39:02,994 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:39:02,994 INFO L139 ounterexampleChecker]: Examining path program with hash -1302077278, occurence #1 [2024-12-05 09:39:02,994 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:39:02,994 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:39:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:39:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1830924301, now seen corresponding path program 2 times [2024-12-05 09:39:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:39:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763144287] [2024-12-05 09:39:02,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:39:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:39:03,142 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:39:03,142 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:39:03,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 09:39:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:39:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763144287] [2024-12-05 09:39:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763144287] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:39:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:39:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:39:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208343061] [2024-12-05 09:39:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:39:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:39:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:39:03,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:39:03,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:39:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:03,779 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:39:03,780 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 09:39:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:39:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:39:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:39:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-12-05 09:39:15,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:39:15,621 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:39:15,621 INFO L139 ounterexampleChecker]: Examining path program with hash -1941471932, occurence #1 [2024-12-05 09:39:15,621 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:39:15,621 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:39:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:39:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2022363768, now seen corresponding path program 1 times [2024-12-05 09:39:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:39:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615535079] [2024-12-05 09:39:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:39:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:39:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:39:15,701 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:39:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:39:15,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:39:15,836 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:39:15,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:39:15,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:39:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-12-05 09:39:15,839 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:39:15,839 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:39:15,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-12-05 09:39:15,903 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-12-05 09:39:15,906 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:39:15,956 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:39:15,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:39:15,957 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:39:15,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:39:28,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:39:28,901 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:39:28,901 INFO L139 ounterexampleChecker]: Examining path program with hash -1617874795, occurence #1 [2024-12-05 09:39:28,901 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:39:28,901 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:39:28,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:39:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash -313547461, now seen corresponding path program 1 times [2024-12-05 09:39:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:39:28,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317469172] [2024-12-05 09:39:28,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:39:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:39:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:39:28,969 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 09:39:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:39:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317469172] [2024-12-05 09:39:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317469172] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:39:28,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:39:28,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:39:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854044834] [2024-12-05 09:39:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:39:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:39:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:39:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:39:28,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:39:28,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:39:28,970 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:39:28,970 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 09:39:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:05,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-12-05 09:40:05,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:40:05,009 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:40:05,009 INFO L139 ounterexampleChecker]: Examining path program with hash 296866195, occurence #1 [2024-12-05 09:40:05,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:40:05,009 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:40:05,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:40:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1067985109, now seen corresponding path program 1 times [2024-12-05 09:40:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:40:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964229730] [2024-12-05 09:40:05,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:40:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:40:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:40:05,511 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 09:40:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:40:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964229730] [2024-12-05 09:40:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964229730] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:40:05,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:40:05,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 09:40:05,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104637477] [2024-12-05 09:40:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:40:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 09:40:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:40:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 09:40:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 09:40:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:05,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:40:05,513 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 09:40:05,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:05,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:40:07,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-12-05 09:40:07,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:40:07,411 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:40:07,412 INFO L139 ounterexampleChecker]: Examining path program with hash -1866342137, occurence #1 [2024-12-05 09:40:07,412 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:40:07,412 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:40:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:40:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 60965553, now seen corresponding path program 2 times [2024-12-05 09:40:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:40:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915886452] [2024-12-05 09:40:07,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 09:40:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:40:07,582 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 09:40:07,582 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 09:40:08,252 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 09:40:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:40:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915886452] [2024-12-05 09:40:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915886452] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:40:08,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:40:08,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 09:40:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723168373] [2024-12-05 09:40:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:40:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 09:40:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:40:08,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 09:40:08,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 09:40:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:08,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:40:08,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 4 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 09:40:08,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:08,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:40:08,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 09:40:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 09:40:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-12-05 09:40:21,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:40:21,419 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:40:21,419 INFO L139 ounterexampleChecker]: Examining path program with hash -1911178409, occurence #1 [2024-12-05 09:40:21,419 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:40:21,419 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:40:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:40:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1037329885, now seen corresponding path program 1 times [2024-12-05 09:40:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:40:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280057306] [2024-12-05 09:40:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:40:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:40:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:40:21,520 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 09:40:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 09:40:21,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 09:40:21,681 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 09:40:21,681 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 09:40:21,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 09:40:21,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-12-05 09:40:21,683 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 09:40:21,684 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 09:40:21,684 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-12-05 09:40:21,769 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-12-05 09:40:21,775 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:40:21,838 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 09:40:21,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 09:40:21,838 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;@18943b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 09:40:21,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 09:40:35,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 09:40:35,460 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 09:40:35,460 INFO L139 ounterexampleChecker]: Examining path program with hash 1157173768, occurence #1 [2024-12-05 09:40:35,460 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 09:40:35,461 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 09:40:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 09:40:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2069213627, now seen corresponding path program 1 times [2024-12-05 09:40:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 09:40:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631938294] [2024-12-05 09:40:35,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 09:40:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 09:40:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 09:40:35,530 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 09:40:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 09:40:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631938294] [2024-12-05 09:40:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631938294] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 09:40:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 09:40:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 09:40:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612904045] [2024-12-05 09:40:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 09:40:35,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 09:40:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 09:40:35,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 09:40:35,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 09:40:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 09:40:35,531 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 09:40:35,531 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 09:40:35,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.