./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/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_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/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_c07a87ae-af72-47e0-9ce1-46efdbad46cf/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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 08:18:49,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 08:18:49,584 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-05 08:18:49,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 08:18:49,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-05 08:18:49,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 08:18:49,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-05 08:18:49,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-05 08:18:49,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 08:18:49,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-05 08:18:49,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 08:18:49,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 08:18:49,608 INFO L153 SettingsManager]: * Use SBE=true [2024-12-05 08:18:49,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 08:18:49,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 08:18:49,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-05 08:18:49,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:18:49,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-05 08:18:49,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-05 08:18:49,612 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-05 08:18:49,612 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-05 08:18:49,612 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_c07a87ae-af72-47e0-9ce1-46efdbad46cf/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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-12-05 08:18:49,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 08:18:49,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 08:18:49,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 08:18:49,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 08:18:49,819 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 08:18:49,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-05 08:18:52,418 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/data/4745f8d4c/5bee061d005c4791959f86305af19262/FLAG30de4f138 [2024-12-05 08:18:52,682 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 08:18:52,682 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-05 08:18:52,695 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/data/4745f8d4c/5bee061d005c4791959f86305af19262/FLAG30de4f138 [2024-12-05 08:18:52,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/data/4745f8d4c/5bee061d005c4791959f86305af19262 [2024-12-05 08:18:52,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 08:18:52,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 08:18:52,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 08:18:52,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 08:18:52,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 08:18:52,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:18:52" (1/1) ... [2024-12-05 08:18:52,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109a83aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:52, skipping insertion in model container [2024-12-05 08:18:52,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:18:52" (1/1) ... [2024-12-05 08:18:53,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 08:18:53,236 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_c07a87ae-af72-47e0-9ce1-46efdbad46cf/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i[30176,30189] [2024-12-05 08:18:53,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:18:53,270 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 08:18:53,301 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_c07a87ae-af72-47e0-9ce1-46efdbad46cf/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i[30176,30189] [2024-12-05 08:18:53,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:18:53,340 INFO L204 MainTranslator]: Completed translation [2024-12-05 08:18:53,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53 WrapperNode [2024-12-05 08:18:53,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 08:18:53,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 08:18:53,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 08:18:53,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 08:18:53,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,374 INFO L138 Inliner]: procedures = 172, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-12-05 08:18:53,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 08:18:53,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 08:18:53,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 08:18:53,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 08:18:53,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 08:18:53,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 08:18:53,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 08:18:53,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 08:18:53,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (1/1) ... [2024-12-05 08:18:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:18:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:18:53,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-05 08:18:53,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 08:18:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-05 08:18:53,449 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-05 08:18:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 08:18:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-12-05 08:18:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 08:18:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-05 08:18:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 08:18:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 08:18:53,451 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-05 08:18:53,545 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 08:18:53,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 08:18:53,711 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-05 08:18:53,711 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 08:18:53,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 08:18:53,821 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-05 08:18:53,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:18:53 BoogieIcfgContainer [2024-12-05 08:18:53,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 08:18:53,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-05 08:18:53,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-05 08:18:53,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-05 08:18:53,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:18:52" (1/3) ... [2024-12-05 08:18:53,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccd8699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:18:53, skipping insertion in model container [2024-12-05 08:18:53,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:53" (2/3) ... [2024-12-05 08:18:53,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccd8699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:18:53, skipping insertion in model container [2024-12-05 08:18:53,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:18:53" (3/3) ... [2024-12-05 08:18:53,831 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-12-05 08:18:53,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-05 08:18:53,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 39 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-12-05 08:18:53,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-05 08:18:53,888 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-05 08:18:53,935 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:53,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-05 08:18:53,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:18:53,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-05 08:18:53,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c07a87ae-af72-47e0-9ce1-46efdbad46cf/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-05 08:18:53,999 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:54,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:54,019 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:54,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:54,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:54,186 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:54,186 INFO L139 ounterexampleChecker]: Examining path program with hash 845264736, occurence #1 [2024-12-05 08:18:54,186 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:54,187 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1508174008, now seen corresponding path program 1 times [2024-12-05 08:18:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011737284] [2024-12-05 08:18:54,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011737284] [2024-12-05 08:18:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011737284] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:18:54,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578409769] [2024-12-05 08:18:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:54,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:18:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:54,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:18:54,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:18:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:54,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:54,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:54,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-05 08:18:54,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:54,482 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:54,482 INFO L139 ounterexampleChecker]: Examining path program with hash -704309705, occurence #1 [2024-12-05 08:18:54,482 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:54,483 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:54,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1123355962, now seen corresponding path program 1 times [2024-12-05 08:18:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436112948] [2024-12-05 08:18:54,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:54,514 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:54,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:54,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:54,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:54,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-05 08:18:54,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-05 08:18:54,557 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:54,557 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-05 08:18:54,572 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-05 08:18:54,575 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:54,582 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:54,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:54,583 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:54,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:54,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:54,844 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:54,844 INFO L139 ounterexampleChecker]: Examining path program with hash -580711066, occurence #1 [2024-12-05 08:18:54,844 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:54,844 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:54,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1551219917, now seen corresponding path program 1 times [2024-12-05 08:18:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479735312] [2024-12-05 08:18:54,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479735312] [2024-12-05 08:18:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479735312] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:18:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983265508] [2024-12-05 08:18:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:54,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:18:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:54,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:18:54,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:18:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:54,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:54,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-05 08:18:55,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:55,350 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:55,350 INFO L139 ounterexampleChecker]: Examining path program with hash 1571076790, occurence #1 [2024-12-05 08:18:55,350 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:55,350 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2106380142, now seen corresponding path program 1 times [2024-12-05 08:18:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467262740] [2024-12-05 08:18:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467262740] [2024-12-05 08:18:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467262740] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:55,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:55,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:18:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161875624] [2024-12-05 08:18:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:55,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:18:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:55,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:18:55,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:18:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:55,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-05 08:18:55,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:55,609 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:55,609 INFO L139 ounterexampleChecker]: Examining path program with hash 1083327706, occurence #1 [2024-12-05 08:18:55,609 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:55,609 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -663650746, now seen corresponding path program 1 times [2024-12-05 08:18:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:55,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749612381] [2024-12-05 08:18:55,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749612381] [2024-12-05 08:18:55,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749612381] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:55,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-05 08:18:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288767089] [2024-12-05 08:18:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-05 08:18:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-05 08:18:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-05 08:18:55,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:55,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:55,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:55,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:18:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-05 08:18:55,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:55,884 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:55,884 INFO L139 ounterexampleChecker]: Examining path program with hash 407575668, occurence #1 [2024-12-05 08:18:55,885 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:55,885 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:55,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1363819227, now seen corresponding path program 1 times [2024-12-05 08:18:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:55,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381752736] [2024-12-05 08:18:55,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:55,903 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:55,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:55,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:55,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:55,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-05 08:18:55,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:18:55,920 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:55,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-05 08:18:55,939 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-05 08:18:55,942 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:55,953 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:55,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:55,954 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:55,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:56,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:56,346 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:56,346 INFO L139 ounterexampleChecker]: Examining path program with hash 628853820, occurence #1 [2024-12-05 08:18:56,347 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:56,347 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:56,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1698693359, now seen corresponding path program 1 times [2024-12-05 08:18:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938437893] [2024-12-05 08:18:56,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938437893] [2024-12-05 08:18:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938437893] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:18:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996250310] [2024-12-05 08:18:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:56,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:18:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:56,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:18:56,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:18:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:56,381 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:56,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-05 08:18:57,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:57,407 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:57,407 INFO L139 ounterexampleChecker]: Examining path program with hash -550040294, occurence #1 [2024-12-05 08:18:57,407 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:57,408 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1286707003, now seen corresponding path program 1 times [2024-12-05 08:18:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603674782] [2024-12-05 08:18:57,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:57,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603674782] [2024-12-05 08:18:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603674782] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:57,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:18:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224023434] [2024-12-05 08:18:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:18:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:57,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:18:57,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:18:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,533 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:57,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:57,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:57,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-05 08:18:57,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:57,705 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:57,706 INFO L139 ounterexampleChecker]: Examining path program with hash 1824110660, occurence #1 [2024-12-05 08:18:57,706 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:57,706 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 709050016, now seen corresponding path program 1 times [2024-12-05 08:18:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708411155] [2024-12-05 08:18:57,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708411155] [2024-12-05 08:18:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708411155] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:57,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:18:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144171009] [2024-12-05 08:18:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:57,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:18:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:57,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:18:57,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:18:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,881 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:57,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:57,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:57,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:18:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:18:58,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-05 08:18:58,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:58,048 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:58,048 INFO L139 ounterexampleChecker]: Examining path program with hash -1469974474, occurence #1 [2024-12-05 08:18:58,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:58,049 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1308296803, now seen corresponding path program 1 times [2024-12-05 08:18:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488140448] [2024-12-05 08:18:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:58,067 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:58,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:58,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:58,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:58,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:58,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-05 08:18:58,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:18:58,084 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:58,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-05 08:18:58,102 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-05 08:18:58,105 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:58,115 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:58,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:58,116 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:58,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:58,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:58,565 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:58,565 INFO L139 ounterexampleChecker]: Examining path program with hash 1020643975, occurence #1 [2024-12-05 08:18:58,565 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:58,565 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 509256593, now seen corresponding path program 1 times [2024-12-05 08:18:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064053433] [2024-12-05 08:18:58,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064053433] [2024-12-05 08:18:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064053433] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:58,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:58,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:18:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203297462] [2024-12-05 08:18:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:58,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:18:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:58,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:18:58,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:18:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:58,588 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:58,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:59,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-05 08:18:59,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:59,778 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:59,778 INFO L139 ounterexampleChecker]: Examining path program with hash -820800608, occurence #1 [2024-12-05 08:18:59,778 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:59,778 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -735302537, now seen corresponding path program 1 times [2024-12-05 08:18:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826874985] [2024-12-05 08:18:59,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:18:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:18:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:18:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826874985] [2024-12-05 08:18:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826874985] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:18:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:18:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:18:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713865759] [2024-12-05 08:18:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:18:59,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:18:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:18:59,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:18:59,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:18:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:59,868 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:18:59,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:18:59,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:18:59,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-05 08:19:00,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:00,060 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:00,060 INFO L139 ounterexampleChecker]: Examining path program with hash 1075083711, occurence #1 [2024-12-05 08:19:00,060 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:00,060 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:00,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1571424605, now seen corresponding path program 1 times [2024-12-05 08:19:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901907459] [2024-12-05 08:19:00,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901907459] [2024-12-05 08:19:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901907459] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:00,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269030612] [2024-12-05 08:19:00,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:00,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:00,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:00,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:00,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:00,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:00,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:00,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-05 08:19:00,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:00,422 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:00,422 INFO L139 ounterexampleChecker]: Examining path program with hash -1134867012, occurence #1 [2024-12-05 08:19:00,422 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:00,423 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:00,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash 562389766, now seen corresponding path program 1 times [2024-12-05 08:19:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523404353] [2024-12-05 08:19:00,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:00,439 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:00,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:00,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:00,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:00,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-05 08:19:00,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:00,459 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:00,459 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-05 08:19:00,479 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-05 08:19:00,481 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:00,493 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:00,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:00,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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:00,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:01,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:01,080 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:01,080 INFO L139 ounterexampleChecker]: Examining path program with hash 2020886956, occurence #1 [2024-12-05 08:19:01,080 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:01,080 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1724118430, now seen corresponding path program 1 times [2024-12-05 08:19:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679514401] [2024-12-05 08:19:01,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679514401] [2024-12-05 08:19:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679514401] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814399500] [2024-12-05 08:19:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:01,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:01,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:01,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:01,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:02,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-05 08:19:02,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:02,843 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:02,844 INFO L139 ounterexampleChecker]: Examining path program with hash -1827872524, occurence #1 [2024-12-05 08:19:02,844 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:02,844 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1646264638, now seen corresponding path program 1 times [2024-12-05 08:19:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490434060] [2024-12-05 08:19:02,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490434060] [2024-12-05 08:19:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490434060] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288835222] [2024-12-05 08:19:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:02,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:02,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:02,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:02,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:02,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:03,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-05 08:19:03,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:03,214 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:03,214 INFO L139 ounterexampleChecker]: Examining path program with hash 1773943229, occurence #1 [2024-12-05 08:19:03,214 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:03,214 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1820074399, now seen corresponding path program 1 times [2024-12-05 08:19:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120350693] [2024-12-05 08:19:03,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120350693] [2024-12-05 08:19:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120350693] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618308294] [2024-12-05 08:19:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:03,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:03,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:03,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,329 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:03,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:03,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-05 08:19:03,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:03,648 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:03,648 INFO L139 ounterexampleChecker]: Examining path program with hash 2127316097, occurence #1 [2024-12-05 08:19:03,648 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:03,648 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:03,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1025591654, now seen corresponding path program 1 times [2024-12-05 08:19:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:03,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83219030] [2024-12-05 08:19:03,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:03,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:03,665 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:03,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:03,684 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:03,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:03,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-05 08:19:03,685 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:03,686 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:03,686 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-05 08:19:03,707 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-05 08:19:03,709 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:03,721 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:03,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:03,722 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:03,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:04,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:04,518 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:04,518 INFO L139 ounterexampleChecker]: Examining path program with hash 474149905, occurence #1 [2024-12-05 08:19:04,518 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:04,518 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:04,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -423106369, now seen corresponding path program 1 times [2024-12-05 08:19:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976361313] [2024-12-05 08:19:04,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976361313] [2024-12-05 08:19:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976361313] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:04,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299755191] [2024-12-05 08:19:04,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:04,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:04,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:04,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:04,542 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:04,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:04,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:06,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-05 08:19:06,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:06,661 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:06,661 INFO L139 ounterexampleChecker]: Examining path program with hash 1060709127, occurence #1 [2024-12-05 08:19:06,661 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:06,661 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 69175565, now seen corresponding path program 1 times [2024-12-05 08:19:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725097475] [2024-12-05 08:19:06,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725097475] [2024-12-05 08:19:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725097475] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536858049] [2024-12-05 08:19:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:06,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:06,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:06,782 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:06,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:06,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:06,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:07,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-05 08:19:07,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:07,169 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:07,169 INFO L139 ounterexampleChecker]: Examining path program with hash 593921724, occurence #1 [2024-12-05 08:19:07,169 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:07,169 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -998058261, now seen corresponding path program 1 times [2024-12-05 08:19:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128401648] [2024-12-05 08:19:07,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128401648] [2024-12-05 08:19:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128401648] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615742318] [2024-12-05 08:19:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,335 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:07,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:07,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-05 08:19:07,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:07,844 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:07,844 INFO L139 ounterexampleChecker]: Examining path program with hash 1369901526, occurence #1 [2024-12-05 08:19:07,844 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:07,844 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1618851287, now seen corresponding path program 1 times [2024-12-05 08:19:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372216555] [2024-12-05 08:19:07,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:07,897 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:07,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:07,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:07,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:07,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:07,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-05 08:19:07,917 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:07,918 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:07,918 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-12-05 08:19:07,938 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-12-05 08:19:07,941 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:07,955 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:07,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:07,956 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:07,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:08,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:08,938 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:08,938 INFO L139 ounterexampleChecker]: Examining path program with hash -1464193714, occurence #1 [2024-12-05 08:19:08,938 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:08,938 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:08,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1943210703, now seen corresponding path program 1 times [2024-12-05 08:19:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544069761] [2024-12-05 08:19:08,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544069761] [2024-12-05 08:19:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544069761] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:08,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451257575] [2024-12-05 08:19:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:08,958 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:08,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-05 08:19:11,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:11,918 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:11,918 INFO L139 ounterexampleChecker]: Examining path program with hash 1163798459, occurence #1 [2024-12-05 08:19:11,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:11,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:11,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash 247246765, now seen corresponding path program 1 times [2024-12-05 08:19:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582468186] [2024-12-05 08:19:11,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582468186] [2024-12-05 08:19:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582468186] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377949754] [2024-12-05 08:19:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:12,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:12,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:12,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:12,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,003 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:12,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-05 08:19:12,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:12,461 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:12,461 INFO L139 ounterexampleChecker]: Examining path program with hash -2074445875, occurence #1 [2024-12-05 08:19:12,461 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:12,461 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1721694648, now seen corresponding path program 1 times [2024-12-05 08:19:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943498356] [2024-12-05 08:19:12,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943498356] [2024-12-05 08:19:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943498356] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914688636] [2024-12-05 08:19:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:12,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:12,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,670 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:12,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:13,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-05 08:19:13,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:13,207 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:13,207 INFO L139 ounterexampleChecker]: Examining path program with hash 1534697757, occurence #1 [2024-12-05 08:19:13,207 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:13,207 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash 975103358, now seen corresponding path program 1 times [2024-12-05 08:19:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385082252] [2024-12-05 08:19:13,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:13,225 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:13,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:13,249 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:13,249 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:13,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:13,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-05 08:19:13,250 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:13,251 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:13,251 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-12-05 08:19:13,276 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-05 08:19:13,278 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:13,293 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:13,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:13,293 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:13,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:14,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:14,567 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:14,567 INFO L139 ounterexampleChecker]: Examining path program with hash -815938244, occurence #1 [2024-12-05 08:19:14,567 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:14,567 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 63097577, now seen corresponding path program 1 times [2024-12-05 08:19:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233496413] [2024-12-05 08:19:14,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233496413] [2024-12-05 08:19:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233496413] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949983131] [2024-12-05 08:19:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:14,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:14,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:14,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-05 08:19:18,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:18,123 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:18,123 INFO L139 ounterexampleChecker]: Examining path program with hash -582609075, occurence #1 [2024-12-05 08:19:18,123 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:18,123 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:18,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1602051223, now seen corresponding path program 1 times [2024-12-05 08:19:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375428837] [2024-12-05 08:19:18,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375428837] [2024-12-05 08:19:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375428837] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789358050] [2024-12-05 08:19:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:18,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:18,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:18,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:18,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:18,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-05 08:19:18,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:18,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:18,804 INFO L139 ounterexampleChecker]: Examining path program with hash 1047036387, occurence #1 [2024-12-05 08:19:18,804 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:18,804 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:18,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1788616678, now seen corresponding path program 1 times [2024-12-05 08:19:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348463505] [2024-12-05 08:19:18,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:18,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348463505] [2024-12-05 08:19:18,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348463505] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:18,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:18,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113837674] [2024-12-05 08:19:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:18,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:18,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:18,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,930 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:18,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:18,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:18,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:18,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-05 08:19:19,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:19,619 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:19,620 INFO L139 ounterexampleChecker]: Examining path program with hash -30348313, occurence #1 [2024-12-05 08:19:19,620 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:19,620 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:19,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash 332151414, now seen corresponding path program 1 times [2024-12-05 08:19:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579233161] [2024-12-05 08:19:19,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:19,640 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:19,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:19,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:19,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:19,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-05 08:19:19,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:19,664 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:19,664 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-12-05 08:19:19,693 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-12-05 08:19:19,695 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:19,710 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:19,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:19,710 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:19,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:21,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:21,058 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:21,058 INFO L139 ounterexampleChecker]: Examining path program with hash 72322561, occurence #1 [2024-12-05 08:19:21,058 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:21,058 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1405052632, now seen corresponding path program 1 times [2024-12-05 08:19:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896536384] [2024-12-05 08:19:21,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896536384] [2024-12-05 08:19:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896536384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876375654] [2024-12-05 08:19:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:21,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:21,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:21,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:21,079 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:21,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:21,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-05 08:19:25,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:25,336 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:25,337 INFO L139 ounterexampleChecker]: Examining path program with hash -334390076, occurence #1 [2024-12-05 08:19:25,337 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:25,337 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:25,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1595251472, now seen corresponding path program 1 times [2024-12-05 08:19:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728697315] [2024-12-05 08:19:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728697315] [2024-12-05 08:19:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728697315] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:25,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743111677] [2024-12-05 08:19:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:25,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:25,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:25,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:25,424 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:25,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:25,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-05 08:19:26,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:26,023 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:26,023 INFO L139 ounterexampleChecker]: Examining path program with hash 836139571, occurence #1 [2024-12-05 08:19:26,023 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:26,024 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:26,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash 847794623, now seen corresponding path program 1 times [2024-12-05 08:19:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306033974] [2024-12-05 08:19:26,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:26,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306033974] [2024-12-05 08:19:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306033974] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751264407] [2024-12-05 08:19:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:26,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:26,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:26,189 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:26,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:26,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:26,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:26,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-05 08:19:27,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:27,145 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:27,145 INFO L139 ounterexampleChecker]: Examining path program with hash -558047849, occurence #1 [2024-12-05 08:19:27,145 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:27,145 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1554835230, now seen corresponding path program 1 times [2024-12-05 08:19:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221972164] [2024-12-05 08:19:27,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:27,165 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:27,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:27,187 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:27,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:27,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:27,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-05 08:19:27,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:27,189 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:27,189 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-12-05 08:19:27,218 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-12-05 08:19:27,220 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:27,239 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:27,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:27,240 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:27,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:28,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:28,854 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:28,854 INFO L139 ounterexampleChecker]: Examining path program with hash -1534064080, occurence #1 [2024-12-05 08:19:28,854 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:28,854 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 649933493, now seen corresponding path program 1 times [2024-12-05 08:19:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201539681] [2024-12-05 08:19:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:28,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201539681] [2024-12-05 08:19:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201539681] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639091783] [2024-12-05 08:19:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:28,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:28,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:28,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:28,874 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:28,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-05 08:19:33,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:33,736 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:33,737 INFO L139 ounterexampleChecker]: Examining path program with hash -1428899308, occurence #1 [2024-12-05 08:19:33,737 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:33,737 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1689949430, now seen corresponding path program 1 times [2024-12-05 08:19:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927826341] [2024-12-05 08:19:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19: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 08:19:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927826341] [2024-12-05 08:19:33,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927826341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:33,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687574751] [2024-12-05 08:19:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:33,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:33,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:33,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:33,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:33,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:34,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-05 08:19:34,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:34,512 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:34,512 INFO L139 ounterexampleChecker]: Examining path program with hash 43292177, occurence #1 [2024-12-05 08:19:34,512 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:34,512 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:34,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1567206637, now seen corresponding path program 1 times [2024-12-05 08:19:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:34,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829273394] [2024-12-05 08:19:34,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829273394] [2024-12-05 08:19:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829273394] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459021585] [2024-12-05 08:19:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:34,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,656 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:34,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:34,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:34,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-05 08:19:35,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:35,726 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:35,727 INFO L139 ounterexampleChecker]: Examining path program with hash -643433912, occurence #1 [2024-12-05 08:19:35,727 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:35,727 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:35,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash 413796895, now seen corresponding path program 1 times [2024-12-05 08:19:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855989182] [2024-12-05 08:19:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:35,747 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:35,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:35,766 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:35,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:35,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-05 08:19:35,768 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:35,768 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:35,768 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-12-05 08:19:35,801 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-12-05 08:19:35,803 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:35,823 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:35,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:35,824 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:35,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:37,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:37,698 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:37,698 INFO L139 ounterexampleChecker]: Examining path program with hash 1844886811, occurence #1 [2024-12-05 08:19:37,698 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:37,698 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1707531011, now seen corresponding path program 1 times [2024-12-05 08:19:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726648377] [2024-12-05 08:19:37,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726648377] [2024-12-05 08:19:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726648377] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333093068] [2024-12-05 08:19:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:37,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:37,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:37,722 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:37,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:37,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-05 08:19:43,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:43,241 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:43,241 INFO L139 ounterexampleChecker]: Examining path program with hash 1496079891, occurence #1 [2024-12-05 08:19:43,241 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:43,241 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2110542577, now seen corresponding path program 1 times [2024-12-05 08:19:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464919446] [2024-12-05 08:19:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464919446] [2024-12-05 08:19:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464919446] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381288731] [2024-12-05 08:19:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:43,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:43,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:43,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:43,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:43,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:43,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:44,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-05 08:19:44,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:44,362 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:44,363 INFO L139 ounterexampleChecker]: Examining path program with hash -111142291, occurence #1 [2024-12-05 08:19:44,363 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:44,363 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -896911415, now seen corresponding path program 1 times [2024-12-05 08:19:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603856215] [2024-12-05 08:19:44,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603856215] [2024-12-05 08:19:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603856215] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:44,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:44,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959096168] [2024-12-05 08:19:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:44,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:44,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:44,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:44,565 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:44,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:44,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:44,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:45,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-05 08:19:45,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:45,899 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:45,899 INFO L139 ounterexampleChecker]: Examining path program with hash -3934684, occurence #1 [2024-12-05 08:19:45,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:45,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1120450795, now seen corresponding path program 1 times [2024-12-05 08:19:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087570394] [2024-12-05 08:19:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:45,923 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:45,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:45,954 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:45,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:45,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:45,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-05 08:19:45,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:45,957 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:45,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-12-05 08:19:45,992 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-12-05 08:19:45,995 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:46,016 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:46,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:46,017 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:46,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:48,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:48,264 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:48,265 INFO L139 ounterexampleChecker]: Examining path program with hash 847091588, occurence #1 [2024-12-05 08:19:48,265 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:48,265 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 130153157, now seen corresponding path program 1 times [2024-12-05 08:19:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422781384] [2024-12-05 08:19:48,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422781384] [2024-12-05 08:19:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422781384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:19:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310099196] [2024-12-05 08:19:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:48,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:19:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:48,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:19:48,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:19:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:48,288 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:48,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:54,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-05 08:19:54,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:54,692 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:54,693 INFO L139 ounterexampleChecker]: Examining path program with hash 417995255, occurence #1 [2024-12-05 08:19:54,693 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:54,693 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1417969369, now seen corresponding path program 1 times [2024-12-05 08:19:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952623395] [2024-12-05 08:19:54,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952623395] [2024-12-05 08:19:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952623395] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:54,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954852526] [2024-12-05 08:19:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:19:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:54,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:19:54,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:19:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:54,803 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:54,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:54,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:54,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:55,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-05 08:19:55,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:55,819 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:55,819 INFO L139 ounterexampleChecker]: Examining path program with hash 1067270868, occurence #1 [2024-12-05 08:19:55,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:55,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:55,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -661876296, now seen corresponding path program 1 times [2024-12-05 08:19:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783697464] [2024-12-05 08:19:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:19:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:19:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:19:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783697464] [2024-12-05 08:19:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783697464] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:19:56,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:19:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:19:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530158046] [2024-12-05 08:19:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:19:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:19:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:19:56,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:19:56,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:19:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:56,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:19:56,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:19:56,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:56,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:56,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:19:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:19:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:19:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-05 08:19:57,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:57,955 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:57,955 INFO L139 ounterexampleChecker]: Examining path program with hash -1172811868, occurence #1 [2024-12-05 08:19:57,955 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:57,955 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2024716876, now seen corresponding path program 1 times [2024-12-05 08:19:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282048143] [2024-12-05 08:19:57,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:57,983 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:58,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:58,022 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:58,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:58,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:58,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-05 08:19:58,024 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:19:58,024 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:58,024 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-12-05 08:19:58,060 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-12-05 08:19:58,062 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:58,081 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:58,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:58,082 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:58,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:00,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:00,526 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:00,526 INFO L139 ounterexampleChecker]: Examining path program with hash -313782592, occurence #1 [2024-12-05 08:20:00,527 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:00,527 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1621151170, now seen corresponding path program 1 times [2024-12-05 08:20:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673808224] [2024-12-05 08:20:00,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673808224] [2024-12-05 08:20:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673808224] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:00,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:20:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929211853] [2024-12-05 08:20:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:20:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:00,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:20:00,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:20:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:00,608 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:00,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:00,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-05 08:20:07,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:07,861 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:07,861 INFO L139 ounterexampleChecker]: Examining path program with hash 965044718, occurence #1 [2024-12-05 08:20:07,861 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:07,861 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1156684617, now seen corresponding path program 1 times [2024-12-05 08:20:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359701760] [2024-12-05 08:20:07,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359701760] [2024-12-05 08:20:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359701760] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254483995] [2024-12-05 08:20:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:07,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:20:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:07,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:20:07,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:20:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:07,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:07,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-05 08:20:09,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:09,095 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:09,095 INFO L139 ounterexampleChecker]: Examining path program with hash -13524363, occurence #1 [2024-12-05 08:20:09,095 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:09,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1450112718, now seen corresponding path program 1 times [2024-12-05 08:20:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858960722] [2024-12-05 08:20:09,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858960722] [2024-12-05 08:20:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858960722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433621161] [2024-12-05 08:20:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:09,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:20:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:09,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:20:09,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:20:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:09,317 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:09,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:09,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:09,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:09,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:20:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-05 08:20:11,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:11,155 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:11,155 INFO L139 ounterexampleChecker]: Examining path program with hash 1248021887, occurence #1 [2024-12-05 08:20:11,155 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:11,155 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash 647723449, now seen corresponding path program 1 times [2024-12-05 08:20:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618168327] [2024-12-05 08:20:11,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:11,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:11,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:11,225 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:11,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:11,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-05 08:20:11,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:20:11,227 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:11,227 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-12-05 08:20:11,263 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-12-05 08:20:11,266 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:11,286 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:11,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:11,287 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:11,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:14,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:14,287 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:14,287 INFO L139 ounterexampleChecker]: Examining path program with hash -1742013183, occurence #1 [2024-12-05 08:20:14,287 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:14,287 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash 273221773, now seen corresponding path program 1 times [2024-12-05 08:20:14,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:14,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635445718] [2024-12-05 08:20:14,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:14,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:14,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635445718] [2024-12-05 08:20:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635445718] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:14,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:14,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:20:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41372973] [2024-12-05 08:20:14,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:14,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:20:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:20:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:20:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:14,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:14,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-05 08:20:23,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:23,208 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:23,208 INFO L139 ounterexampleChecker]: Examining path program with hash -2113104087, occurence #1 [2024-12-05 08:20:23,208 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:23,208 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1910856157, now seen corresponding path program 1 times [2024-12-05 08:20:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597610973] [2024-12-05 08:20:23,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597610973] [2024-12-05 08:20:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597610973] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478392533] [2024-12-05 08:20:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:20:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:20:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:20:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,346 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:23,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:23,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:24,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-05 08:20:24,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:24,614 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:24,614 INFO L139 ounterexampleChecker]: Examining path program with hash 1644006554, occurence #1 [2024-12-05 08:20:24,614 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:24,614 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:24,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1594851721, now seen corresponding path program 1 times [2024-12-05 08:20:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647352358] [2024-12-05 08:20:24,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647352358] [2024-12-05 08:20:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647352358] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070098512] [2024-12-05 08:20:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:20:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:24,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:20:24,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:20:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:24,927 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:24,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:24,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:24,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:20:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-12-05 08:20:27,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:27,488 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:27,489 INFO L139 ounterexampleChecker]: Examining path program with hash -1898331900, occurence #1 [2024-12-05 08:20:27,489 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:27,489 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1592699049, now seen corresponding path program 1 times [2024-12-05 08:20:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084439159] [2024-12-05 08:20:27,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:27,513 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:27,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:27,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:27,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:27,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-05 08:20:27,552 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-05 08:20:27,553 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:27,553 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-12-05 08:20:27,593 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-12-05 08:20:27,596 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:27,622 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:27,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:27,623 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:27,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:31,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:31,013 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:31,013 INFO L139 ounterexampleChecker]: Examining path program with hash 37363589, occurence #1 [2024-12-05 08:20:31,014 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:31,014 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:31,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1858764501, now seen corresponding path program 1 times [2024-12-05 08:20:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953764458] [2024-12-05 08:20:31,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953764458] [2024-12-05 08:20:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953764458] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:20:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770831223] [2024-12-05 08:20:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:20:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:31,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:20:31,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:20:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:31,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:31,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:31,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:40,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-05 08:20:40,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:40,878 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:40,878 INFO L139 ounterexampleChecker]: Examining path program with hash 975361203, occurence #1 [2024-12-05 08:20:40,878 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:40,878 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:40,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1725713469, now seen corresponding path program 1 times [2024-12-05 08:20:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620521062] [2024-12-05 08:20:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620521062] [2024-12-05 08:20:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620521062] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948024636] [2024-12-05 08:20:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:20:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:20:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:20:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:41,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:41,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:41,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:41,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:42,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-05 08:20:42,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:42,507 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:42,507 INFO L139 ounterexampleChecker]: Examining path program with hash 497115961, occurence #1 [2024-12-05 08:20:42,507 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:42,507 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:42,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1735096921, now seen corresponding path program 2 times [2024-12-05 08:20:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207097655] [2024-12-05 08:20:42,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:20:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:42,550 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:20:42,550 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:20:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207097655] [2024-12-05 08:20:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207097655] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:20:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637124359] [2024-12-05 08:20:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:20:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:42,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:20:42,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:20:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:42,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:20:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:20:45,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-05 08:20:45,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:45,830 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:45,830 INFO L139 ounterexampleChecker]: Examining path program with hash -831155825, occurence #1 [2024-12-05 08:20:45,830 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:45,830 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1167457943, now seen corresponding path program 1 times [2024-12-05 08:20:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750507292] [2024-12-05 08:20:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:45,856 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:45,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:45,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:45,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:45,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:45,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-12-05 08:20:45,890 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:20:45,890 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:45,890 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-12-05 08:20:45,927 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-12-05 08:20:45,930 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:45,955 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:45,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:45,956 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:45,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:49,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:49,716 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:49,716 INFO L139 ounterexampleChecker]: Examining path program with hash 1539226655, occurence #1 [2024-12-05 08:20:49,716 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:49,716 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash 347139703, now seen corresponding path program 1 times [2024-12-05 08:20:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867498045] [2024-12-05 08:20:49,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:20:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:20:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:20:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867498045] [2024-12-05 08:20:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867498045] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:20:49,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:20:49,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:20:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623558155] [2024-12-05 08:20:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:20:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:20:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:20:49,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:20:49,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:20:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:20:49,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:20:49,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:20:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:01,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-05 08:21:01,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:01,097 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:01,097 INFO L139 ounterexampleChecker]: Examining path program with hash -127167143, occurence #1 [2024-12-05 08:21:01,097 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:01,097 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash 974589316, now seen corresponding path program 1 times [2024-12-05 08:21:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713345505] [2024-12-05 08:21:01,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:01,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 08:21:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713345505] [2024-12-05 08:21:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713345505] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555710468] [2024-12-05 08:21:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:01,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:21:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:01,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:21:01,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:21:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:01,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:01,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:01,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:01,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:02,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-12-05 08:21:02,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:02,558 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:02,559 INFO L139 ounterexampleChecker]: Examining path program with hash -1861099836, occurence #1 [2024-12-05 08:21:02,559 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:02,559 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:02,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -313842970, now seen corresponding path program 2 times [2024-12-05 08:21:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:02,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971279448] [2024-12-05 08:21:02,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:21:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:02,598 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:21:02,598 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:21:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971279448] [2024-12-05 08:21:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971279448] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532652033] [2024-12-05 08:21:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:21:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:02,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:21:02,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:21:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:02,798 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:02,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:02,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:02,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:02,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:21:06,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-12-05 08:21:06,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:06,231 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:06,231 INFO L139 ounterexampleChecker]: Examining path program with hash 230989635, occurence #1 [2024-12-05 08:21:06,231 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:06,232 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:06,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1477982045, now seen corresponding path program 1 times [2024-12-05 08:21:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741297488] [2024-12-05 08:21:06,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:06,260 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:21:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:06,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:21:06,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:21:06,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:21:06,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:21:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-12-05 08:21:06,298 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:21:06,298 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:21:06,298 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-12-05 08:21:06,346 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-12-05 08:21:06,348 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:06,379 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:21:06,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:21:06,380 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:06,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:21:10,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:10,598 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:10,598 INFO L139 ounterexampleChecker]: Examining path program with hash 668864725, occurence #1 [2024-12-05 08:21:10,598 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:10,598 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:10,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1616415100, now seen corresponding path program 1 times [2024-12-05 08:21:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018219674] [2024-12-05 08:21:10,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:10,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018219674] [2024-12-05 08:21:10,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018219674] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:10,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:10,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:21:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449827303] [2024-12-05 08:21:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:21:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:10,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:21:10,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:21:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:10,630 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:10,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:22,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-12-05 08:21:22,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:22,741 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:22,742 INFO L139 ounterexampleChecker]: Examining path program with hash -50583783, occurence #1 [2024-12-05 08:21:22,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:22,742 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:22,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:22,742 INFO L85 PathProgramCache]: Analyzing trace with hash 676864800, now seen corresponding path program 1 times [2024-12-05 08:21:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174631794] [2024-12-05 08:21:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174631794] [2024-12-05 08:21:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174631794] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161408942] [2024-12-05 08:21:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:21:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:22,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:21:22,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:21:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:22,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:22,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:22,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:22,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-12-05 08:21:24,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:24,358 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:24,358 INFO L139 ounterexampleChecker]: Examining path program with hash 1753117192, occurence #1 [2024-12-05 08:21:24,358 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:24,358 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1867047522, now seen corresponding path program 2 times [2024-12-05 08:21:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288356258] [2024-12-05 08:21:24,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:21:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:24,403 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:21:24,403 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:21:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288356258] [2024-12-05 08:21:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288356258] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405561448] [2024-12-05 08:21:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:24,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:21:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:21:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:21:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:24,641 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:24,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:24,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:24,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:21:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-12-05 08:21:28,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:28,734 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:28,734 INFO L139 ounterexampleChecker]: Examining path program with hash 1411739697, occurence #1 [2024-12-05 08:21:28,734 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:28,734 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1054866218, now seen corresponding path program 1 times [2024-12-05 08:21:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755137168] [2024-12-05 08:21:28,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:28,764 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:21:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:28,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:21:28,826 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:21:28,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:21:28,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:21:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-12-05 08:21:28,828 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:21:28,828 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:21:28,828 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-12-05 08:21:28,869 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-12-05 08:21:28,873 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:28,900 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:21:28,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:21:28,901 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:28,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:21:33,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:33,561 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:33,561 INFO L139 ounterexampleChecker]: Examining path program with hash 390869433, occurence #1 [2024-12-05 08:21:33,561 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:33,561 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:33,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 440973561, now seen corresponding path program 1 times [2024-12-05 08:21:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236292154] [2024-12-05 08:21:33,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236292154] [2024-12-05 08:21:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236292154] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:33,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:21:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384366997] [2024-12-05 08:21:33,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:21:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:33,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:21:33,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:21:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:33,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:33,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:33,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-12-05 08:21:47,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:47,149 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:47,150 INFO L139 ounterexampleChecker]: Examining path program with hash 1560815600, occurence #1 [2024-12-05 08:21:47,150 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:47,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 747642421, now seen corresponding path program 1 times [2024-12-05 08:21:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465288052] [2024-12-05 08:21:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465288052] [2024-12-05 08:21:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465288052] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492081202] [2024-12-05 08:21:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:47,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:21:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:47,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:21:47,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:21:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:47,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:47,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:47,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:47,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:48,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-12-05 08:21:48,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:48,910 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:48,911 INFO L139 ounterexampleChecker]: Examining path program with hash 907043323, occurence #1 [2024-12-05 08:21:48,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:48,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -451751095, now seen corresponding path program 2 times [2024-12-05 08:21:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486362015] [2024-12-05 08:21:48,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:21:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:48,955 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:21:48,955 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:21:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486362015] [2024-12-05 08:21:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486362015] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:21:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155193365] [2024-12-05 08:21:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:21:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:21:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:21:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:49,245 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:49,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:49,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:49,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:49,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:21:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:21:53,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-12-05 08:21:53,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:53,966 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:53,966 INFO L139 ounterexampleChecker]: Examining path program with hash -975277632, occurence #1 [2024-12-05 08:21:53,966 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:53,966 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:53,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 772389653, now seen corresponding path program 1 times [2024-12-05 08:21:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:53,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665167821] [2024-12-05 08:21:53,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:54,000 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:21:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:54,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:21:54,053 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:21:54,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:21:54,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:21:54,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-12-05 08:21:54,055 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:21:54,055 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:21:54,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-12-05 08:21:54,106 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-12-05 08:21:54,109 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:54,140 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:21:54,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:21:54,141 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:54,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:21:59,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:59,451 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:59,451 INFO L139 ounterexampleChecker]: Examining path program with hash 16041264, occurence #1 [2024-12-05 08:21:59,451 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:59,451 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -973691863, now seen corresponding path program 1 times [2024-12-05 08:21:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686565489] [2024-12-05 08:21:59,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:21:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:21:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:21:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686565489] [2024-12-05 08:21:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686565489] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:21:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:21:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:21:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218845736] [2024-12-05 08:21:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:21:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:21:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:21:59,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:21:59,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:21:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:21:59,486 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:21:59,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:21:59,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:14,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-12-05 08:22:14,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:14,270 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:14,271 INFO L139 ounterexampleChecker]: Examining path program with hash 1668453906, occurence #1 [2024-12-05 08:22:14,271 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:14,271 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1157617336, now seen corresponding path program 1 times [2024-12-05 08:22:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204831482] [2024-12-05 08:22:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:22:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204831482] [2024-12-05 08:22:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204831482] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:22:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987657184] [2024-12-05 08:22:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:22:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:14,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:22:14,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:22:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:14,460 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:14,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:14,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:14,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:16,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-12-05 08:22:16,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:16,067 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:16,067 INFO L139 ounterexampleChecker]: Examining path program with hash -607701064, occurence #1 [2024-12-05 08:22:16,067 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:16,067 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:16,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 550308386, now seen corresponding path program 2 times [2024-12-05 08:22:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624341375] [2024-12-05 08:22:16,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:22:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:16,123 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:22:16,123 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:22:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:16,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624341375] [2024-12-05 08:22:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624341375] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:22:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992421816] [2024-12-05 08:22:16,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:16,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:22:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:16,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:22:16,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:22:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:16,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:16,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:16,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:16,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:22:21,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-12-05 08:22:21,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:21,464 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:21,465 INFO L139 ounterexampleChecker]: Examining path program with hash -1381159524, occurence #1 [2024-12-05 08:22:21,465 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:21,465 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:21,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:21,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1428976197, now seen corresponding path program 1 times [2024-12-05 08:22:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678388664] [2024-12-05 08:22:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:21,496 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:22:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:21,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:22:21,538 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:22:21,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:22:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:22:21,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-12-05 08:22:21,540 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:22:21,540 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:22:21,540 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-12-05 08:22:21,581 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-12-05 08:22:21,583 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:21,612 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:22:21,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:22:21,613 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:21,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:22:27,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:27,471 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:27,471 INFO L139 ounterexampleChecker]: Examining path program with hash 389800232, occurence #1 [2024-12-05 08:22:27,471 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:27,471 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:27,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 167600509, now seen corresponding path program 1 times [2024-12-05 08:22:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754701207] [2024-12-05 08:22:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:22:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754701207] [2024-12-05 08:22:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754701207] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:22:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943957293] [2024-12-05 08:22:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:22:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:27,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:22:27,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:22:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:27,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:27,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:27,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-12-05 08:22:43,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:43,402 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:43,402 INFO L139 ounterexampleChecker]: Examining path program with hash 863531693, occurence #1 [2024-12-05 08:22:43,402 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:43,402 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -146946560, now seen corresponding path program 1 times [2024-12-05 08:22:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188491059] [2024-12-05 08:22:43,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:22:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:43,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:43,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188491059] [2024-12-05 08:22:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188491059] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:43,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:22:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652847134] [2024-12-05 08:22:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:22:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:43,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:22:43,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:22:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:43,676 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:43,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:43,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:43,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-12-05 08:22:45,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:45,237 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:45,237 INFO L139 ounterexampleChecker]: Examining path program with hash 1249396580, occurence #1 [2024-12-05 08:22:45,237 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:45,237 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2104853610, now seen corresponding path program 2 times [2024-12-05 08:22:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888805946] [2024-12-05 08:22:45,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:22:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:45,289 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:22:45,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:22:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:45,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888805946] [2024-12-05 08:22:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888805946] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:45,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:45,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:22:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724004945] [2024-12-05 08:22:45,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:45,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:22:45,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:45,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:22:45,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:22:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:45,578 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:45,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:45,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:45,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:45,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:22:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:22:51,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-12-05 08:22:51,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:51,431 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:51,431 INFO L139 ounterexampleChecker]: Examining path program with hash 68220831, occurence #1 [2024-12-05 08:22:51,431 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:51,431 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:51,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 824314706, now seen corresponding path program 1 times [2024-12-05 08:22:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324274010] [2024-12-05 08:22:51,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:51,465 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:22:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:51,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:22:51,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:22:51,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:22:51,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:22:51,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-12-05 08:22:51,513 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:22:51,513 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:22:51,513 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-12-05 08:22:51,557 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-12-05 08:22:51,559 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:51,591 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:22:51,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:22:51,591 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:51,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:22:57,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:57,969 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:57,969 INFO L139 ounterexampleChecker]: Examining path program with hash -370096392, occurence #1 [2024-12-05 08:22:57,969 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:57,969 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:57,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1238458558, now seen corresponding path program 1 times [2024-12-05 08:22:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209072839] [2024-12-05 08:22:57,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:22:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:22:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:22:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209072839] [2024-12-05 08:22:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209072839] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:22:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:22:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:22:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043929622] [2024-12-05 08:22:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:22:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:22:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:22:58,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:22:58,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:22:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:22:58,007 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:22:58,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:22:58,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:15,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-12-05 08:23:15,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:15,720 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:15,720 INFO L139 ounterexampleChecker]: Examining path program with hash -1688883674, occurence #1 [2024-12-05 08:23:15,720 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:15,721 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:15,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -396715733, now seen corresponding path program 1 times [2024-12-05 08:23:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074041242] [2024-12-05 08:23:15,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:23:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:23:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:23:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:23:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074041242] [2024-12-05 08:23:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074041242] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:23:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:23:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:23:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357310868] [2024-12-05 08:23:15,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:23:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:23:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:23:15,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:23:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:23:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:15,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:23:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:23:15,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:15,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:23:17,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-12-05 08:23:17,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:17,480 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:17,480 INFO L139 ounterexampleChecker]: Examining path program with hash -185706284, occurence #1 [2024-12-05 08:23:17,480 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:17,480 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:17,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:17,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1450496243, now seen corresponding path program 2 times [2024-12-05 08:23:17,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:17,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051883673] [2024-12-05 08:23:17,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:23:17,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:17,539 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:23:17,539 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:23:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:23:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:23:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051883673] [2024-12-05 08:23:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051883673] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:23:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:23:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:23:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930803381] [2024-12-05 08:23:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:23:17,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:23:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:23:17,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:23:17,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:23:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:17,887 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:23:17,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:23:17,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:17,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:23:17,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:23:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:23:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-12-05 08:23:24,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:24,354 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:24,354 INFO L139 ounterexampleChecker]: Examining path program with hash -1401291176, occurence #1 [2024-12-05 08:23:24,354 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:24,354 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:24,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1474768600, now seen corresponding path program 1 times [2024-12-05 08:23:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281872147] [2024-12-05 08:23:24,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:23:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:23:24,389 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:23:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:23:24,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:23:24,439 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:23:24,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:23:24,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:23:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-12-05 08:23:24,441 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:23:24,441 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:23:24,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-12-05 08:23:24,496 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-12-05 08:23:24,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:23:24,538 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:23:24,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:23:24,539 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:23:24,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:23:31,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:31,546 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:31,546 INFO L139 ounterexampleChecker]: Examining path program with hash 472299920, occurence #1 [2024-12-05 08:23:31,546 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:31,546 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1713603193, now seen corresponding path program 1 times [2024-12-05 08:23:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491828535] [2024-12-05 08:23:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:23:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:23:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:23:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:23:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491828535] [2024-12-05 08:23:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491828535] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:23:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:23:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:23:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380146606] [2024-12-05 08:23:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:23:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:23:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:23:31,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:23:31,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:23:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:31,585 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:23:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:23:31,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:50,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-12-05 08:23:50,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:50,907 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:50,907 INFO L139 ounterexampleChecker]: Examining path program with hash 569853317, occurence #1 [2024-12-05 08:23:50,907 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:50,907 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:50,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1297693356, now seen corresponding path program 1 times [2024-12-05 08:23:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:50,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610244410] [2024-12-05 08:23:50,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:23:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:23:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:23:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:23:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610244410] [2024-12-05 08:23:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610244410] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:23:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:23:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:23:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723485104] [2024-12-05 08:23:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:23:51,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:23:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:23:51,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:23:51,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:23:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:51,136 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:23:51,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:23:51,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:51,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:23:52,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-12-05 08:23:52,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:52,862 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:52,863 INFO L139 ounterexampleChecker]: Examining path program with hash 1385111524, occurence #1 [2024-12-05 08:23:52,863 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:52,863 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2032627614, now seen corresponding path program 2 times [2024-12-05 08:23:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297205588] [2024-12-05 08:23:52,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:23:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:52,929 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:23:52,929 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:23:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:23:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:23:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297205588] [2024-12-05 08:23:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297205588] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:23:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:23:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:23:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135534228] [2024-12-05 08:23:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:23:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:23:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:23:53,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:23:53,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:23:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:53,287 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:23:53,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:23:53,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:23:53,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:23:53,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:24:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:24:00,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-12-05 08:24:00,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:00,233 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:00,233 INFO L139 ounterexampleChecker]: Examining path program with hash 1357643136, occurence #1 [2024-12-05 08:24:00,233 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:00,233 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:00,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1302943013, now seen corresponding path program 1 times [2024-12-05 08:24:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506776432] [2024-12-05 08:24:00,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:00,272 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:24:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:00,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:24:00,327 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:24:00,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:24:00,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:24:00,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-12-05 08:24:00,329 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:24:00,329 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:24:00,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-12-05 08:24:00,383 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-12-05 08:24:00,386 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:00,419 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:24:00,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:24:00,420 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:00,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:24:07,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:07,970 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:07,970 INFO L139 ounterexampleChecker]: Examining path program with hash 247953297, occurence #1 [2024-12-05 08:24:07,970 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:07,970 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash 596178271, now seen corresponding path program 1 times [2024-12-05 08:24:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521502318] [2024-12-05 08:24:07,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:24:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:24:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:24:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521502318] [2024-12-05 08:24:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521502318] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:24:08,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:24:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:24:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895261514] [2024-12-05 08:24:08,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:24:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:24:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:24:08,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:24:08,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:24:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:08,016 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:24:08,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:24:08,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:29,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-12-05 08:24:29,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:29,100 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:29,100 INFO L139 ounterexampleChecker]: Examining path program with hash -2134786263, occurence #1 [2024-12-05 08:24:29,100 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:29,100 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash 929907308, now seen corresponding path program 1 times [2024-12-05 08:24:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965574835] [2024-12-05 08:24:29,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:24:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:24:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:24:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965574835] [2024-12-05 08:24:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965574835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:24:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:24:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:24:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25009650] [2024-12-05 08:24:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:24:29,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:24:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:24:29,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:24:29,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:24:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:29,377 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:24:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:24:29,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:29,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:24:30,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-12-05 08:24:30,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:30,983 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:30,983 INFO L139 ounterexampleChecker]: Examining path program with hash 58123655, occurence #1 [2024-12-05 08:24:30,983 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:30,983 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1122820312, now seen corresponding path program 2 times [2024-12-05 08:24:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640407800] [2024-12-05 08:24:30,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:24:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:31,058 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:24:31,058 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:24:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:24:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:24:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640407800] [2024-12-05 08:24:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640407800] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:24:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:24:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:24:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750478267] [2024-12-05 08:24:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:24:31,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:24:31,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:24:31,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:24:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:24:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:31,379 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:24:31,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:24:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:24:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:24:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:24:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-12-05 08:24:39,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:39,627 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:39,628 INFO L139 ounterexampleChecker]: Examining path program with hash 1755619072, occurence #1 [2024-12-05 08:24:39,628 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:39,628 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -987220015, now seen corresponding path program 1 times [2024-12-05 08:24:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677325780] [2024-12-05 08:24:39,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:39,671 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:24:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:39,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:24:39,737 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:24:39,737 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:24:39,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:24:39,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-12-05 08:24:39,739 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:24:39,739 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:24:39,739 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-12-05 08:24:39,788 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-12-05 08:24:39,790 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:39,824 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:24:39,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:24:39,824 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:39,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:24:48,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:48,095 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:48,095 INFO L139 ounterexampleChecker]: Examining path program with hash 709089910, occurence #1 [2024-12-05 08:24:48,095 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:48,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash -942687071, now seen corresponding path program 1 times [2024-12-05 08:24:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772171293] [2024-12-05 08:24:48,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:24:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:24:48,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:24:48,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772171293] [2024-12-05 08:24:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772171293] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:24:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:24:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:24:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373141385] [2024-12-05 08:24:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:24:48,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:24:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:24:48,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:24:48,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:24:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:24:48,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:24:48,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:24:48,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-12-05 08:25:11,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:11,855 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:11,855 INFO L139 ounterexampleChecker]: Examining path program with hash 1758502326, occurence #1 [2024-12-05 08:25:11,855 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:11,855 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash 449399933, now seen corresponding path program 1 times [2024-12-05 08:25:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882946050] [2024-12-05 08:25:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:25:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:25:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:25:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:25:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882946050] [2024-12-05 08:25:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882946050] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:25:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:25:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:25:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961069717] [2024-12-05 08:25:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:25:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:25:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:25:12,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:25:12,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:25:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:12,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:25:12,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:25:12,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:12,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:25:13,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-12-05 08:25:13,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:13,861 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:13,861 INFO L139 ounterexampleChecker]: Examining path program with hash 541197036, occurence #1 [2024-12-05 08:25:13,861 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:13,861 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:13,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1908136101, now seen corresponding path program 2 times [2024-12-05 08:25:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625688780] [2024-12-05 08:25:13,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:25:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:13,925 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:25:13,926 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:25:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:25:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:25:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625688780] [2024-12-05 08:25:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625688780] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:25:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:25:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:25:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973789434] [2024-12-05 08:25:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:25:14,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:25:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:25:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:25:14,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:25:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:14,260 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:25:14,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:25:14,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:14,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:25:14,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:25:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:25:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-12-05 08:25:22,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:22,894 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:22,894 INFO L139 ounterexampleChecker]: Examining path program with hash 1723958776, occurence #1 [2024-12-05 08:25:22,894 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:22,895 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1451885564, now seen corresponding path program 1 times [2024-12-05 08:25:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486973595] [2024-12-05 08:25:22,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:25:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:25:22,939 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:25:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:25:23,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:25:23,007 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:25:23,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:25:23,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:25:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-12-05 08:25:23,009 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:25:23,009 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:25:23,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-12-05 08:25:23,069 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-12-05 08:25:23,073 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:25:23,107 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:25:23,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:25:23,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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:25:23,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:25:32,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:32,299 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:32,300 INFO L139 ounterexampleChecker]: Examining path program with hash -618457885, occurence #1 [2024-12-05 08:25:32,300 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:32,300 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1384338640, now seen corresponding path program 1 times [2024-12-05 08:25:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320773526] [2024-12-05 08:25:32,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:25:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:25:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:25:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:25:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320773526] [2024-12-05 08:25:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320773526] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:25:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:25:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:25:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843859459] [2024-12-05 08:25:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:25:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:25:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:25:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:25:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:25:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:32,362 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:25:32,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:25:32,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-12-05 08:25:57,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:57,798 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:57,798 INFO L139 ounterexampleChecker]: Examining path program with hash 660565651, occurence #1 [2024-12-05 08:25:57,798 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:57,798 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash -793986566, now seen corresponding path program 1 times [2024-12-05 08:25:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390521684] [2024-12-05 08:25:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:25:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:25:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:25:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:25:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390521684] [2024-12-05 08:25:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390521684] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:25:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:25:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:25:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108264016] [2024-12-05 08:25:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:25:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:25:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:25:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:25:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:25:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:58,057 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:25:58,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:25:58,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:58,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:25:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:25:59,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-12-05 08:25:59,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:59,824 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:59,824 INFO L139 ounterexampleChecker]: Examining path program with hash -371529518, occurence #1 [2024-12-05 08:25:59,824 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:59,825 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:59,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash -327022014, now seen corresponding path program 2 times [2024-12-05 08:25:59,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:59,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355141762] [2024-12-05 08:25:59,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:25:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:59,895 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:25:59,896 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:26:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:26:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:26:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355141762] [2024-12-05 08:26:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355141762] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:26:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:26:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:26:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365986331] [2024-12-05 08:26:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:26:00,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:26:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:26:00,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:26:00,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:26:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:00,310 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:26:00,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:26:00,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:00,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:26:00,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:26:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:26:09,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-12-05 08:26:09,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:09,421 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:09,421 INFO L139 ounterexampleChecker]: Examining path program with hash -754719652, occurence #1 [2024-12-05 08:26:09,421 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:09,421 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:09,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash 111294117, now seen corresponding path program 1 times [2024-12-05 08:26:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:09,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229599035] [2024-12-05 08:26:09,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:26:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:09,465 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:26:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:09,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:26:09,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:26:09,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:26:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:26:09,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-12-05 08:26:09,548 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:26:09,548 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:26:09,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-12-05 08:26:09,611 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-12-05 08:26:09,615 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:09,653 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:26:09,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:26:09,654 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:09,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:26:19,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:19,556 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:19,556 INFO L139 ounterexampleChecker]: Examining path program with hash 2026513758, occurence #1 [2024-12-05 08:26:19,556 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:19,556 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1708827481, now seen corresponding path program 1 times [2024-12-05 08:26:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509561149] [2024-12-05 08:26:19,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:26:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:26:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:26:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:26:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509561149] [2024-12-05 08:26:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509561149] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:26:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:26:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:26:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948255656] [2024-12-05 08:26:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:26:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:26:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:26:19,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:26:19,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:26:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:19,607 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:26:19,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:26:19,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:46,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-12-05 08:26:46,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:46,131 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:46,132 INFO L139 ounterexampleChecker]: Examining path program with hash 1667814324, occurence #1 [2024-12-05 08:26:46,132 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:46,132 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:46,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1188339602, now seen corresponding path program 1 times [2024-12-05 08:26:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276185136] [2024-12-05 08:26:46,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:26:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:26:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:26:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:26:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276185136] [2024-12-05 08:26:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276185136] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:26:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:26:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:26:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308382899] [2024-12-05 08:26:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:26:46,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:26:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:26:46,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:26:46,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:26:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:46,420 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:26:46,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:26:46,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:46,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:26:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-12-05 08:26:48,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:48,249 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:48,249 INFO L139 ounterexampleChecker]: Examining path program with hash -1430479164, occurence #1 [2024-12-05 08:26:48,249 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:48,249 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1251458582, now seen corresponding path program 2 times [2024-12-05 08:26:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71615699] [2024-12-05 08:26:48,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:26:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:48,325 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:26:48,325 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:26:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:26:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:26:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71615699] [2024-12-05 08:26:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71615699] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:26:48,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:26:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:26:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11406717] [2024-12-05 08:26:48,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:26:48,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:26:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:26:48,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:26:48,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:26:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:48,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:26:48,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:26:48,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:48,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:26:48,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:26:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:26:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:26:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-12-05 08:26:58,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:58,854 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:58,854 INFO L139 ounterexampleChecker]: Examining path program with hash 1092134470, occurence #1 [2024-12-05 08:26:58,854 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:58,854 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 664837979, now seen corresponding path program 1 times [2024-12-05 08:26:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931055554] [2024-12-05 08:26:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:26:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:58,903 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:26:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:58,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:26:58,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:26:58,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:26:58,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:26:58,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-12-05 08:26:58,979 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:26:58,979 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:26:58,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-12-05 08:26:59,028 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-12-05 08:26:59,031 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:59,069 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:26:59,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:26:59,070 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:59,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:27:09,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:27:09,095 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:27:09,095 INFO L139 ounterexampleChecker]: Examining path program with hash 759551420, occurence #1 [2024-12-05 08:27:09,095 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:27:09,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:27:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:27:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1019577271, now seen corresponding path program 1 times [2024-12-05 08:27:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:27:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794577670] [2024-12-05 08:27:09,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:27:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:27:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:27:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:27:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:27:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794577670] [2024-12-05 08:27:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794577670] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:27:09,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:27:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:27:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428976782] [2024-12-05 08:27:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:27:09,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:27:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:27:09,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:27:09,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:27:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:09,149 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:27:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:27:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:37,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-12-05 08:27:37,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:27:37,618 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:27:37,618 INFO L139 ounterexampleChecker]: Examining path program with hash 2130626011, occurence #1 [2024-12-05 08:27:37,618 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:27:37,618 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:27:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:27:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1609769217, now seen corresponding path program 1 times [2024-12-05 08:27:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:27:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108385955] [2024-12-05 08:27:37,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:27:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:27:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:27:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:27:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:27:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108385955] [2024-12-05 08:27:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108385955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:27:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:27:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:27:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415903018] [2024-12-05 08:27:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:27:37,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:27:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:27:37,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:27:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:27:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:37,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:27:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:27:37,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:37,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:27:39,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-12-05 08:27:39,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:27:39,767 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:27:39,767 INFO L139 ounterexampleChecker]: Examining path program with hash -169608848, occurence #1 [2024-12-05 08:27:39,767 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:27:39,767 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:27:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:27:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2000210315, now seen corresponding path program 2 times [2024-12-05 08:27:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:27:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769469543] [2024-12-05 08:27:39,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:27:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:27:39,844 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:27:39,844 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:27:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:27:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:27:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769469543] [2024-12-05 08:27:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769469543] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:27:40,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:27:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:27:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804990242] [2024-12-05 08:27:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:27:40,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:27:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:27:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:27:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:27:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:40,239 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:27:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:27:40,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:40,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:27:40,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:27:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:27:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:27:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-12-05 08:27:51,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:27:51,552 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:27:51,552 INFO L139 ounterexampleChecker]: Examining path program with hash -1653995976, occurence #1 [2024-12-05 08:27:51,552 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:27:51,552 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:27:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:27:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1251715019, now seen corresponding path program 1 times [2024-12-05 08:27:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:27:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818939548] [2024-12-05 08:27:51,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:27:51,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:27:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:27:51,602 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:27:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:27:51,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:27:51,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:27:51,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:27:51,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:27:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-12-05 08:27:51,699 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:27:51,699 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:27:51,699 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-12-05 08:27:51,760 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-12-05 08:27:51,763 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:27:51,803 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:27:51,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:27:51,804 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:27:51,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:28:03,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:28:03,005 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:28:03,005 INFO L139 ounterexampleChecker]: Examining path program with hash 1980814163, occurence #1 [2024-12-05 08:28:03,005 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:28:03,005 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:28:03,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:28:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1267107909, now seen corresponding path program 1 times [2024-12-05 08:28:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:28:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096256520] [2024-12-05 08:28:03,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:28:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:28:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:28:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:28:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:28:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096256520] [2024-12-05 08:28:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096256520] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:28:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:28:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:28:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678953630] [2024-12-05 08:28:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:28:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:28:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:28:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:28:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:28:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:03,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:28:03,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:28:03,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:33,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-12-05 08:28:33,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:28:33,533 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:28:33,534 INFO L139 ounterexampleChecker]: Examining path program with hash -1982943633, occurence #1 [2024-12-05 08:28:33,534 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:28:33,534 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:28:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:28:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1785035335, now seen corresponding path program 1 times [2024-12-05 08:28:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:28:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384699886] [2024-12-05 08:28:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:28:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:28:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:28:33,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 08:28:33,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:28:33,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384699886] [2024-12-05 08:28:33,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384699886] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:28:33,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:28:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:28:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982290384] [2024-12-05 08:28:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:28:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:28:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:28:33,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:28:33,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:28:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:33,849 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:28:33,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:28:33,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:33,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:28:35,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-12-05 08:28:35,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:28:35,821 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:28:35,822 INFO L139 ounterexampleChecker]: Examining path program with hash -1159610870, occurence #1 [2024-12-05 08:28:35,822 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:28:35,822 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:28:35,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:28:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1712410933, now seen corresponding path program 2 times [2024-12-05 08:28:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:28:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993527193] [2024-12-05 08:28:35,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:28:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:28:35,900 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:28:35,900 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:28:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:28:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:28:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993527193] [2024-12-05 08:28:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993527193] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:28:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:28:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:28:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564136975] [2024-12-05 08:28:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:28:36,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:28:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:28:36,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:28:36,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:28:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:36,290 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:28:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:28:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:28:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:28:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:28:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:28:48,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-12-05 08:28:48,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:28:48,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:28:48,150 INFO L139 ounterexampleChecker]: Examining path program with hash -280301684, occurence #1 [2024-12-05 08:28:48,150 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:28:48,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:28:48,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:28:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -447868256, now seen corresponding path program 1 times [2024-12-05 08:28:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:28:48,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307495519] [2024-12-05 08:28:48,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:28:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:28:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:28:48,199 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:28:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:28:48,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:28:48,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:28:48,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:28:48,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:28:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-12-05 08:28:48,288 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:28:48,288 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:28:48,288 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-12-05 08:28:48,354 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-12-05 08:28:48,359 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:28:48,401 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:28:48,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:28:48,402 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:28:48,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:29:00,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:29:00,406 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:29:00,406 INFO L139 ounterexampleChecker]: Examining path program with hash 1595859301, occurence #1 [2024-12-05 08:29:00,406 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:29:00,406 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:29:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:29:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -383889998, now seen corresponding path program 1 times [2024-12-05 08:29:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:29:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403875647] [2024-12-05 08:29:00,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:29:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:29:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:29:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:29:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:29:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403875647] [2024-12-05 08:29:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403875647] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:29:00,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:29:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:29:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878905915] [2024-12-05 08:29:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:29:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:29:00,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:29:00,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:29:00,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:29:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:00,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:29:00,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:29:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:33,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-12-05 08:29:33,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:29:33,046 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:29:33,047 INFO L139 ounterexampleChecker]: Examining path program with hash -573192084, occurence #1 [2024-12-05 08:29:33,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:29:33,047 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:29:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:29:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1356782410, now seen corresponding path program 1 times [2024-12-05 08:29:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:29:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71736377] [2024-12-05 08:29:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:29:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:29:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:29:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:29:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:29:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71736377] [2024-12-05 08:29:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71736377] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:29:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:29:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:29:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886356391] [2024-12-05 08:29:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:29:33,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:29:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:29:33,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:29:33,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:29:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:33,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:29:33,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:29:33,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:33,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:29:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-12-05 08:29:35,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:29:35,232 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:29:35,233 INFO L139 ounterexampleChecker]: Examining path program with hash 1485051075, occurence #1 [2024-12-05 08:29:35,233 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:29:35,233 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:29:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:29:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -984141880, now seen corresponding path program 2 times [2024-12-05 08:29:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:29:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577482215] [2024-12-05 08:29:35,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:29:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:29:35,313 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:29:35,313 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:29:35,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 08:29:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:29:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577482215] [2024-12-05 08:29:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577482215] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:29:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:29:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:29:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117439553] [2024-12-05 08:29:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:29:35,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:29:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:29:35,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:29:35,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:29:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:35,722 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:29:35,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:29:35,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:35,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:29:35,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:29:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:29:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:29:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-12-05 08:29:48,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:29:48,354 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:29:48,354 INFO L139 ounterexampleChecker]: Examining path program with hash -315739167, occurence #1 [2024-12-05 08:29:48,354 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:29:48,354 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:29:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:29:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 767361144, now seen corresponding path program 1 times [2024-12-05 08:29:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:29:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002577081] [2024-12-05 08:29:48,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:29:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:29:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:29:48,407 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:29:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:29:48,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:29:48,521 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:29:48,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:29:48,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:29:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-12-05 08:29:48,523 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:29:48,524 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:29:48,524 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-12-05 08:29:48,582 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-12-05 08:29:48,585 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:29:48,628 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:29:48,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:29:48,629 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:29:48,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:30:01,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:30:01,795 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:30:01,796 INFO L139 ounterexampleChecker]: Examining path program with hash -1278689380, occurence #1 [2024-12-05 08:30:01,796 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:30:01,796 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:30:01,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:30:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1118291057, now seen corresponding path program 1 times [2024-12-05 08:30:01,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:30:01,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439159810] [2024-12-05 08:30:01,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:30:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:30:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:30:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:30:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:30:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439159810] [2024-12-05 08:30:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439159810] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:30:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:30:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:30:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812397746] [2024-12-05 08:30:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:30:01,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:30:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:30:01,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:30:01,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:30:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:01,853 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:30:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:30:01,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:36,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-12-05 08:30:36,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:30:36,754 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:30:36,754 INFO L139 ounterexampleChecker]: Examining path program with hash 1493651799, occurence #1 [2024-12-05 08:30:36,754 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:30:36,754 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:30:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:30:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -37368103, now seen corresponding path program 1 times [2024-12-05 08:30:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:30:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33662843] [2024-12-05 08:30:36,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:30:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:30:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:30:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:30:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:30:37,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33662843] [2024-12-05 08:30:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33662843] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:30:37,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:30:37,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:30:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725524303] [2024-12-05 08:30:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:30:37,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-05 08:30:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:30:37,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-05 08:30:37,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-05 08:30:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:37,215 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:30:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:30:37,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:37,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:30:39,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-12-05 08:30:39,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:30:39,304 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:30:39,305 INFO L139 ounterexampleChecker]: Examining path program with hash 1457053448, occurence #1 [2024-12-05 08:30:39,305 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:30:39,305 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:30:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:30:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1243600171, now seen corresponding path program 2 times [2024-12-05 08:30:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:30:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264616893] [2024-12-05 08:30:39,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-05 08:30:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:30:39,406 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-05 08:30:39,406 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-05 08:30:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:30:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:30:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264616893] [2024-12-05 08:30:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264616893] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:30:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:30:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-05 08:30:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145132499] [2024-12-05 08:30:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:30:39,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-05 08:30:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:30:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-05 08:30:39,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-05 08:30:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:39,839 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:30:39,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:30:39,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:39,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:30:39,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:30:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-05 08:30:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-05 08:30:53,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-12-05 08:30:53,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:30:53,920 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:30:53,920 INFO L139 ounterexampleChecker]: Examining path program with hash -41767458, occurence #1 [2024-12-05 08:30:53,920 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:30:53,920 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:30:53,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:30:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 115270131, now seen corresponding path program 1 times [2024-12-05 08:30:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:30:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388316840] [2024-12-05 08:30:53,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:30:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:30:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:30:53,981 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:30:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:30:54,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:30:54,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:30:54,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:30:54,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:30:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-12-05 08:30:54,141 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-12-05 08:30:54,141 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:30:54,142 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-12-05 08:30:54,205 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-12-05 08:30:54,208 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:30:54,253 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:30:54,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:30:54,254 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;@3d31ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:30:54,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:31:08,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:31:08,048 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:31:08,049 INFO L139 ounterexampleChecker]: Examining path program with hash -327250826, occurence #1 [2024-12-05 08:31:08,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:31:08,049 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:31:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:31:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 136272355, now seen corresponding path program 1 times [2024-12-05 08:31:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:31:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375049382] [2024-12-05 08:31:08,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:31:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:31:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 08:31:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 08:31:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-05 08:31:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375049382] [2024-12-05 08:31:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375049382] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-05 08:31:08,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-05 08:31:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-05 08:31:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463353164] [2024-12-05 08:31:08,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-05 08:31:08,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-05 08:31:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-05 08:31:08,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-05 08:31:08,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-05 08:31:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-05 08:31:08,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-05 08:31:08,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-05 08:31:08,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.