./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 21:34:14,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 21:34:15,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 21:34:15,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 21:34:15,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 21:34:15,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 21:34:15,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 21:34:15,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 21:34:15,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 21:34:15,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 21:34:15,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 21:34:15,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 21:34:15,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 21:34:15,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 21:34:15,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 21:34:15,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 21:34:15,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 21:34:15,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 21:34:15,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 21:34:15,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 21:34:15,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 21:34:15,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 21:34:15,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 21:34:15,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 21:34:15,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 21:34:15,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 21:34:15,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 21:34:15,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 21:34:15,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 21:34:15,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 21:34:15,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:34:15,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 21:34:15,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 21:34:15,075 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 21:34:15,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 21:34:15,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 21:34:15,078 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 21:34:15,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 21:34:15,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 21:34:15,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 21:34:15,079 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 21:34:15,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 21:34:15,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 21:34:15,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 21:34:15,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 21:34:15,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 21:34:15,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 21:34:15,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2024-10-18 21:34:16,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 21:34:17,077 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 21:34:17,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2024-10-18 21:34:17,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7c2877e24/8540d72c1e7b49e5b37fdb1279c1cd2d/FLAG21a8065c0 [2024-10-18 21:34:17,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7c2877e24/8540d72c1e7b49e5b37fdb1279c1cd2d [2024-10-18 21:34:17,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 21:34:17,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 21:34:17,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 21:34:17,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 21:34:17,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 21:34:17,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ea39ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17, skipping insertion in model container [2024-10-18 21:34:17,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 21:34:17,502 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2024-10-18 21:34:17,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:34:17,547 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 21:34:17,580 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2024-10-18 21:34:17,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:34:17,660 INFO L204 MainTranslator]: Completed translation [2024-10-18 21:34:17,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17 WrapperNode [2024-10-18 21:34:17,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 21:34:17,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 21:34:17,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 21:34:17,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 21:34:17,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,726 INFO L138 Inliner]: procedures = 171, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-18 21:34:17,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 21:34:17,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 21:34:17,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 21:34:17,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 21:34:17,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 21:34:17,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 21:34:17,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 21:34:17,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 21:34:17,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (1/1) ... [2024-10-18 21:34:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:34:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:17,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:17,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 21:34:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 21:34:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 21:34:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-18 21:34:17,860 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 21:34:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 21:34:17,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 21:34:17,862 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 21:34:17,987 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 21:34:17,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 21:34:18,188 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 21:34:18,189 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 21:34:18,416 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 21:34:18,417 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-18 21:34:18,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:34:18 BoogieIcfgContainer [2024-10-18 21:34:18,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 21:34:18,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 21:34:18,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 21:34:18,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 21:34:18,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 09:34:17" (1/3) ... [2024-10-18 21:34:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de83da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:34:18, skipping insertion in model container [2024-10-18 21:34:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:34:17" (2/3) ... [2024-10-18 21:34:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de83da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:34:18, skipping insertion in model container [2024-10-18 21:34:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:34:18" (3/3) ... [2024-10-18 21:34:18,433 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-10-18 21:34:18,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 21:34:18,454 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 21:34:18,454 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 21:34:18,495 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-18 21:34:18,552 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:18,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:18,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 21:34:18,663 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:18,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:18,697 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:18,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:19,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:19,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash -949399968, now seen corresponding path program 1 times [2024-10-18 21:34:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921421111] [2024-10-18 21:34:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:19,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921421111] [2024-10-18 21:34:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921421111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:19,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:19,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116759532] [2024-10-18 21:34:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:19,328 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:19,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:19,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:19,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 21:34:19,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:19,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash 191190974, now seen corresponding path program 1 times [2024-10-18 21:34:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303860479] [2024-10-18 21:34:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:19,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:19,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:19,638 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:19,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:19,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:19,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 21:34:19,652 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-18 21:34:19,654 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:19,655 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 21:34:19,677 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 21:34:19,682 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:19,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:19,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:19,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-18 21:34:19,744 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:19,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:19,745 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:19,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:20,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1296020934, now seen corresponding path program 1 times [2024-10-18 21:34:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:20,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100784085] [2024-10-18 21:34:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:34:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100784085] [2024-10-18 21:34:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100784085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268853265] [2024-10-18 21:34:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:20,422 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:20,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:20,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-18 21:34:21,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -165928833, now seen corresponding path program 1 times [2024-10-18 21:34:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:21,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545765291] [2024-10-18 21:34:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545765291] [2024-10-18 21:34:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545765291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 21:34:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069015610] [2024-10-18 21:34:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:21,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 21:34:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,355 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:21,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:34:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-18 21:34:21,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1709339880, now seen corresponding path program 1 times [2024-10-18 21:34:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220730208] [2024-10-18 21:34:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 21:34:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220730208] [2024-10-18 21:34:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220730208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:21,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 21:34:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521667958] [2024-10-18 21:34:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 21:34:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 21:34:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:34:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,759 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:21,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:21,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:34:21,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:34:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 21:34:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 21:34:21,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -587254121, now seen corresponding path program 1 times [2024-10-18 21:34:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96166728] [2024-10-18 21:34:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:21,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:21,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:21,947 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:21,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:21,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 21:34:21,952 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:21,952 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:21,952 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 21:34:22,001 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-18 21:34:22,006 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:22,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:22,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:22,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:22,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-18 21:34:22,054 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:22,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:22,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:22,055 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:22,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:22,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash -655811767, now seen corresponding path program 1 times [2024-10-18 21:34:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076199618] [2024-10-18 21:34:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 21:34:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076199618] [2024-10-18 21:34:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076199618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956427102] [2024-10-18 21:34:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:22,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:22,700 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:22,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:23,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-10-18 21:34:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash -149343141, now seen corresponding path program 1 times [2024-10-18 21:34:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:24,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2024-10-18 21:34:24,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 428357753, now seen corresponding path program 1 times [2024-10-18 21:34:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:24,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795188773] [2024-10-18 21:34:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 21:34:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795188773] [2024-10-18 21:34:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795188773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:24,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:24,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 21:34:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987913930] [2024-10-18 21:34:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 21:34:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-18 21:34:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:24,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:24,815 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-10-18 21:34:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 21:34:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 21:34:25,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash -942526745, now seen corresponding path program 1 times [2024-10-18 21:34:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006370419] [2024-10-18 21:34:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:25,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:25,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:25,199 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:25,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:25,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-18 21:34:25,202 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:25,202 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:25,203 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-18 21:34:25,223 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 21:34:25,227 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:25,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:25,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:25,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:25,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-18 21:34:25,278 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:25,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:25,279 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:25,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:26,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:26,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash 672334339, now seen corresponding path program 1 times [2024-10-18 21:34:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481912893] [2024-10-18 21:34:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-18 21:34:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481912893] [2024-10-18 21:34:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481912893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927215231] [2024-10-18 21:34:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:26,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:26,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:26,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:26,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:26,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:27,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-10-18 21:34:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash -646688664, now seen corresponding path program 1 times [2024-10-18 21:34:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2024-10-18 21:34:28,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:28,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash -5174351, now seen corresponding path program 1 times [2024-10-18 21:34:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836199146] [2024-10-18 21:34:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:28,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-18 21:34:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836199146] [2024-10-18 21:34:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836199146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 21:34:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610360659] [2024-10-18 21:34:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:28,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 21:34:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-18 21:34:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:28,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:28,938 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-10-18 21:34:28,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:28,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 21:34:29,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-18 21:34:29,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1707320437, now seen corresponding path program 1 times [2024-10-18 21:34:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760030982] [2024-10-18 21:34:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:29,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:29,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:29,364 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:29,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:29,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-18 21:34:29,366 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:29,366 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:29,367 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-18 21:34:29,393 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-18 21:34:29,398 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:29,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:29,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-18 21:34:29,444 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:29,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:29,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:29,445 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:29,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:30,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1617142086, now seen corresponding path program 1 times [2024-10-18 21:34:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874726408] [2024-10-18 21:34:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-18 21:34:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874726408] [2024-10-18 21:34:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874726408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578869082] [2024-10-18 21:34:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:30,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:30,708 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:30,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:30,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:31,998 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:31,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:34:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -165531599, now seen corresponding path program 1 times [2024-10-18 21:34:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:32,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-10-18 21:34:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:33,720 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:33,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2024-10-18 21:34:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2004065971, now seen corresponding path program 1 times [2024-10-18 21:34:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:34:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-18 21:34:34,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1205593627, now seen corresponding path program 1 times [2024-10-18 21:34:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638451471] [2024-10-18 21:34:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:34,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:34,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:34,684 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:34,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:34,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:34,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-18 21:34:34,690 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:34,690 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:34,690 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-18 21:34:34,735 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-18 21:34:34,738 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:34,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:34,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-18 21:34:34,783 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:34,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:34,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:34,785 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:34,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:36,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:36,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2061833408, now seen corresponding path program 1 times [2024-10-18 21:34:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838731849] [2024-10-18 21:34:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:36,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-18 21:34:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838731849] [2024-10-18 21:34:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838731849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885917131] [2024-10-18 21:34:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:36,431 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:36,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:36,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:37,790 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:37,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:34:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2029936996, now seen corresponding path program 1 times [2024-10-18 21:34:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:37,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-10-18 21:34:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:37,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:39,450 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:34:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1059516869, now seen corresponding path program 1 times [2024-10-18 21:34:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:34:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:40,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2024-10-18 21:34:40,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2053644094, now seen corresponding path program 1 times [2024-10-18 21:34:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898366332] [2024-10-18 21:34:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:40,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:40,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:40,910 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:40,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:40,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-18 21:34:40,913 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:40,913 WARN L239 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:40,913 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-10-18 21:34:40,938 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-10-18 21:34:40,940 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:40,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:40,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:40,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-18 21:34:40,992 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:40,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:40,995 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:40,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:42,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 24102983, now seen corresponding path program 1 times [2024-10-18 21:34:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061542028] [2024-10-18 21:34:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-18 21:34:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061542028] [2024-10-18 21:34:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061542028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311502325] [2024-10-18 21:34:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:42,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:42,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:42,819 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:42,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:44,246 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:44,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:34:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash -784722109, now seen corresponding path program 1 times [2024-10-18 21:34:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:44,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-10-18 21:34:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:46,094 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:46,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:34:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1540119258, now seen corresponding path program 1 times [2024-10-18 21:34:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:34:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable28 [2024-10-18 21:34:47,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 296045264, now seen corresponding path program 1 times [2024-10-18 21:34:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952074390] [2024-10-18 21:34:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:47,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:47,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:47,798 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:47,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:47,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-18 21:34:47,800 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:47,801 WARN L239 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:47,801 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-10-18 21:34:47,827 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-10-18 21:34:47,829 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:47,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:47,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-10-18 21:34:47,877 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:47,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:47,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:47,878 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:47,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:50,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -793196950, now seen corresponding path program 1 times [2024-10-18 21:34:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:50,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503325376] [2024-10-18 21:34:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-18 21:34:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503325376] [2024-10-18 21:34:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503325376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:50,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:50,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520556124] [2024-10-18 21:34:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:50,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:50,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:50,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:50,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:51,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2024-10-18 21:34:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 321918715, now seen corresponding path program 1 times [2024-10-18 21:34:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:34:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:34:53,755 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:34:53,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:34:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 532801795, now seen corresponding path program 1 times [2024-10-18 21:34:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:34:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:34:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:34:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2024-10-18 21:34:56,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:56,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -824984484, now seen corresponding path program 1 times [2024-10-18 21:34:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591087282] [2024-10-18 21:34:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:56,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:34:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:34:56,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:34:56,071 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:34:56,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:34:56,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:34:56,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-18 21:34:56,075 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:34:56,076 WARN L239 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:34:56,076 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-10-18 21:34:56,107 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-10-18 21:34:56,109 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:34:56,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:34:56,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:34:56,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:34:56,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-18 21:34:56,164 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:34:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:56,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:34:56,165 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:34:56,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:34:58,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:34:58,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:34:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash -708715072, now seen corresponding path program 1 times [2024-10-18 21:34:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:34:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410520954] [2024-10-18 21:34:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:34:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:34:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:34:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-18 21:34:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:34:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410520954] [2024-10-18 21:34:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410520954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:34:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:34:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:34:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424574310] [2024-10-18 21:34:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:34:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:34:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:34:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:34:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:34:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:34:59,017 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:34:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:34:59,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:00,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-10-18 21:35:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1291637696, now seen corresponding path program 1 times [2024-10-18 21:35:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:35:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:35:02,427 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:35:02,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:35:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1335632487, now seen corresponding path program 1 times [2024-10-18 21:35:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:35:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:35:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44 [2024-10-18 21:35:05,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:05,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash -541770872, now seen corresponding path program 1 times [2024-10-18 21:35:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049212825] [2024-10-18 21:35:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:05,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:35:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:05,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:35:05,547 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:35:05,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:35:05,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:35:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-18 21:35:05,549 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:35:05,551 WARN L239 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:35:05,551 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-10-18 21:35:05,580 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-10-18 21:35:05,583 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:35:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:35:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:35:05,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:35:05,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-10-18 21:35:05,638 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:35:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:05,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:35:05,639 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:35:05,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:35:08,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash -249205136, now seen corresponding path program 1 times [2024-10-18 21:35:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704385169] [2024-10-18 21:35:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-18 21:35:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:35:08,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704385169] [2024-10-18 21:35:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704385169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:35:08,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:35:08,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:35:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136168437] [2024-10-18 21:35:08,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:35:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:35:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:35:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:35:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:35:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:08,656 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:35:08,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:35:08,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:10,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-10-18 21:35:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -224792154, now seen corresponding path program 1 times [2024-10-18 21:35:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:10,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:35:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:35:12,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-10-18 21:35:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -314913835, now seen corresponding path program 1 times [2024-10-18 21:35:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:35:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:35:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-10-18 21:35:15,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash -50392252, now seen corresponding path program 1 times [2024-10-18 21:35:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008179007] [2024-10-18 21:35:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:15,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:35:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:15,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:35:15,703 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:35:15,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:35:15,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:35:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-18 21:35:15,705 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:35:15,705 WARN L239 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:35:15,705 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-10-18 21:35:15,737 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-10-18 21:35:15,739 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:35:15,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:35:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:35:15,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:35:15,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-10-18 21:35:15,795 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:35:15,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:15,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:35:15,797 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:35:15,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:35:19,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1146960309, now seen corresponding path program 1 times [2024-10-18 21:35:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195373042] [2024-10-18 21:35:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-18 21:35:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:35:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195373042] [2024-10-18 21:35:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195373042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:35:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:35:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:35:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624045156] [2024-10-18 21:35:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:35:19,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:35:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:35:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:35:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:35:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:19,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:35:19,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:35:19,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:21,055 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:35:21,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-10-18 21:35:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1702411841, now seen corresponding path program 1 times [2024-10-18 21:35:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:35:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:35:23,162 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:35:23,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:35:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 184997170, now seen corresponding path program 1 times [2024-10-18 21:35:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:35:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:35:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:27,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56 [2024-10-18 21:35:27,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:27,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -65236578, now seen corresponding path program 1 times [2024-10-18 21:35:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841595813] [2024-10-18 21:35:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:27,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:35:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:27,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:35:27,971 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:35:27,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:35:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:35:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-18 21:35:27,973 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:35:27,973 WARN L239 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:35:27,973 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-10-18 21:35:28,004 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-10-18 21:35:28,007 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:35:28,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:35:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:35:28,012 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:35:28,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-18 21:35:28,071 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:35:28,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:28,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:35:28,073 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:35:28,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:35:32,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -640212636, now seen corresponding path program 1 times [2024-10-18 21:35:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727242543] [2024-10-18 21:35:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-18 21:35:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:35:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727242543] [2024-10-18 21:35:32,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727242543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:35:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:35:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:35:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141179225] [2024-10-18 21:35:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:35:32,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:35:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:35:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:35:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:35:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:32,340 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:35:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:35:32,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:34,259 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:35:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:35:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1656778623, now seen corresponding path program 1 times [2024-10-18 21:35:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:35:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:35:36,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-10-18 21:35:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1658892168, now seen corresponding path program 1 times [2024-10-18 21:35:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:36,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-10-18 21:35:36,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:35:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:35:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-18 21:35:42,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -361390631, now seen corresponding path program 1 times [2024-10-18 21:35:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847731897] [2024-10-18 21:35:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:42,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:35:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:42,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:35:42,217 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:35:42,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:35:42,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:35:42,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-18 21:35:42,219 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:35:42,219 WARN L239 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:35:42,219 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-10-18 21:35:42,256 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-10-18 21:35:42,260 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:35:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:35:42,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:35:42,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:35:42,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-10-18 21:35:42,320 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:35:42,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:42,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:35:42,321 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:35:42,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:35:47,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:47,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1157675930, now seen corresponding path program 1 times [2024-10-18 21:35:47,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:47,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350222347] [2024-10-18 21:35:47,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-18 21:35:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:35:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350222347] [2024-10-18 21:35:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350222347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:35:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:35:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:35:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623112296] [2024-10-18 21:35:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:35:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:35:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:35:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:35:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:35:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:47,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:35:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:35:47,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:49,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-10-18 21:35:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1636694425, now seen corresponding path program 1 times [2024-10-18 21:35:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:35:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:35:51,250 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:35:51,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:35:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1793419215, now seen corresponding path program 1 times [2024-10-18 21:35:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:51,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-10-18 21:35:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:35:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:35:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:35:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:35:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:35:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68 [2024-10-18 21:35:57,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:35:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -302826037, now seen corresponding path program 1 times [2024-10-18 21:35:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:35:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791569149] [2024-10-18 21:35:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:35:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:35:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:57,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:35:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:35:57,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:35:57,647 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:35:57,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:35:57,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:35:57,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-10-18 21:35:57,649 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:35:57,650 WARN L239 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:35:57,650 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-10-18 21:35:57,689 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-10-18 21:35:57,692 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:35:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:35:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:35:57,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:35:57,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-18 21:35:57,755 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:35:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:35:57,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:35:57,756 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:35:57,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:36:03,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:03,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash -696760790, now seen corresponding path program 1 times [2024-10-18 21:36:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102517945] [2024-10-18 21:36:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-18 21:36:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:36:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102517945] [2024-10-18 21:36:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102517945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:36:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:36:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:36:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549175577] [2024-10-18 21:36:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:36:03,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:36:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:36:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:36:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:36:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:03,280 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:36:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:36:03,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:05,473 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:36:05,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-10-18 21:36:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1077451821, now seen corresponding path program 1 times [2024-10-18 21:36:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:36:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:36:07,690 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:36:07,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2024-10-18 21:36:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1722276211, now seen corresponding path program 1 times [2024-10-18 21:36:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:36:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:36:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:15,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74 [2024-10-18 21:36:15,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 703230777, now seen corresponding path program 1 times [2024-10-18 21:36:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131871679] [2024-10-18 21:36:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:15,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:36:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:15,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:36:15,512 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:36:15,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:36:15,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:36:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-10-18 21:36:15,516 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:36:15,516 WARN L239 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:36:15,516 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-10-18 21:36:15,557 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-10-18 21:36:15,561 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:36:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:36:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:36:15,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:36:15,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-10-18 21:36:15,627 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:36:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:15,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:36:15,628 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:36:15,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:36:21,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1916329827, now seen corresponding path program 1 times [2024-10-18 21:36:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37259307] [2024-10-18 21:36:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-18 21:36:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:36:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37259307] [2024-10-18 21:36:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37259307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:36:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:36:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:36:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172541724] [2024-10-18 21:36:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:36:21,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:36:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:36:21,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:36:21,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:36:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:21,634 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:36:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:36:21,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:23,908 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:36:23,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2024-10-18 21:36:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1787875952, now seen corresponding path program 1 times [2024-10-18 21:36:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:36:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:36:26,459 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:36:26,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2024-10-18 21:36:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash -175189224, now seen corresponding path program 1 times [2024-10-18 21:36:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:36:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:36:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:35,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-10-18 21:36:35,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:35,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash 382120213, now seen corresponding path program 1 times [2024-10-18 21:36:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597518881] [2024-10-18 21:36:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:35,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:36:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:35,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:36:35,741 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:36:35,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:36:35,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:36:35,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-10-18 21:36:35,743 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:36:35,743 WARN L239 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:36:35,744 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-10-18 21:36:35,790 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-10-18 21:36:35,794 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:36:35,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:36:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:36:35,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:36:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-18 21:36:35,857 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:36:35,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:35,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:36:35,858 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:36:35,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:36:42,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:42,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1354363610, now seen corresponding path program 1 times [2024-10-18 21:36:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916311528] [2024-10-18 21:36:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-18 21:36:42,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:36:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916311528] [2024-10-18 21:36:42,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916311528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:36:42,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:36:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:36:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063097013] [2024-10-18 21:36:42,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:36:42,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:36:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:36:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:36:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:36:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:42,579 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:36:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:36:42,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:45,083 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:36:45,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:36:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 900451712, now seen corresponding path program 1 times [2024-10-18 21:36:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:36:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:36:47,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-10-18 21:36:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash -29832773, now seen corresponding path program 1 times [2024-10-18 21:36:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:36:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:36:47,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:36:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:36:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:36:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86 [2024-10-18 21:36:57,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:36:57,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1855840738, now seen corresponding path program 1 times [2024-10-18 21:36:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:36:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604971938] [2024-10-18 21:36:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:36:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:36:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:57,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:36:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:36:58,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:36:58,027 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:36:58,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:36:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:36:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-10-18 21:36:58,029 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:36:58,029 WARN L239 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:36:58,029 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-10-18 21:36:58,078 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-10-18 21:36:58,081 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:36:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:36:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:36:58,087 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:36:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-18 21:36:58,151 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:36:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:36:58,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:36:58,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:36:58,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:37:05,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:37:05,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 709803804, now seen corresponding path program 1 times [2024-10-18 21:37:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:37:05,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103892653] [2024-10-18 21:37:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-18 21:37:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:37:05,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103892653] [2024-10-18 21:37:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103892653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:37:05,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:37:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:37:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089423301] [2024-10-18 21:37:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:37:05,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:37:05,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:37:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:37:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:37:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:05,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:37:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:37:05,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:08,128 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:37:08,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:37:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1566062628, now seen corresponding path program 1 times [2024-10-18 21:37:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:37:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:37:10,644 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:37:10,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:37:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -233825236, now seen corresponding path program 1 times [2024-10-18 21:37:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:37:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:37:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2024-10-18 21:37:22,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:37:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1733671071, now seen corresponding path program 1 times [2024-10-18 21:37:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:37:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570809624] [2024-10-18 21:37:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:37:22,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:37:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:37:22,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:37:22,616 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:37:22,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:37:22,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:37:22,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-10-18 21:37:22,617 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:37:22,618 WARN L239 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:37:22,618 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-10-18 21:37:22,672 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-18 21:37:22,676 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:37:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:37:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:37:22,680 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:37:22,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-10-18 21:37:22,745 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:37:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:22,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:37:22,746 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:37:22,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:37:31,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:37:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 890646130, now seen corresponding path program 1 times [2024-10-18 21:37:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:37:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843859535] [2024-10-18 21:37:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-18 21:37:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:37:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843859535] [2024-10-18 21:37:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843859535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:37:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:37:31,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:37:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456538365] [2024-10-18 21:37:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:37:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:37:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:37:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:37:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:37:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:31,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:37:31,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:37:31,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-10-18 21:37:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2117330517, now seen corresponding path program 1 times [2024-10-18 21:37:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:37:34,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:37:36,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2024-10-18 21:37:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 844104379, now seen corresponding path program 1 times [2024-10-18 21:37:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:37:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:37:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:37:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:50,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98 [2024-10-18 21:37:50,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:37:50,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash 779388826, now seen corresponding path program 1 times [2024-10-18 21:37:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:37:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810780457] [2024-10-18 21:37:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:37:50,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:37:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:37:50,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:37:50,235 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:37:50,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:37:50,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:37:50,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-10-18 21:37:50,237 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:37:50,238 WARN L239 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:37:50,238 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-10-18 21:37:50,293 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-10-18 21:37:50,297 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:37:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:37:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:37:50,300 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:37:50,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-18 21:37:50,360 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:37:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:50,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:37:50,361 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:37:50,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:37:59,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:37:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:37:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1888092833, now seen corresponding path program 1 times [2024-10-18 21:37:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:37:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124552110] [2024-10-18 21:37:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:37:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:37:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:37:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-18 21:37:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:37:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124552110] [2024-10-18 21:37:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124552110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:37:59,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:37:59,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:37:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768345926] [2024-10-18 21:37:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:37:59,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:37:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:37:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:37:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:37:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:37:59,530 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:37:59,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:37:59,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:38:02,506 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:38:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:38:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1842298597, now seen corresponding path program 1 times [2024-10-18 21:38:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:02,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:38:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:38:05,007 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:38:05,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:38:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 36953504, now seen corresponding path program 1 times [2024-10-18 21:38:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:38:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:38:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:38:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-10-18 21:38:19,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:38:19,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:38:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1629199271, now seen corresponding path program 1 times [2024-10-18 21:38:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:38:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551210916] [2024-10-18 21:38:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:38:19,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:38:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:38:19,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:38:19,784 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:38:19,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:38:19,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:38:19,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-10-18 21:38:19,786 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:38:19,787 WARN L239 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:38:19,787 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-10-18 21:38:19,843 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-10-18 21:38:19,848 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:38:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:38:19,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:38:19,851 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:38:19,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-18 21:38:19,916 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:38:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:38:19,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:38:19,917 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:38:19,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:38:30,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:38:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:38:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1549708212, now seen corresponding path program 1 times [2024-10-18 21:38:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:38:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404805487] [2024-10-18 21:38:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-10-18 21:38:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:38:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404805487] [2024-10-18 21:38:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404805487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:38:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:38:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:38:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511919828] [2024-10-18 21:38:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:38:30,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:38:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:38:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:38:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:38:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:38:30,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:38:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:38:30,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:38:33,149 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:38:33,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:38:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1609131240, now seen corresponding path program 1 times [2024-10-18 21:38:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:38:33,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:38:35,766 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:38:35,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:38:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1762106609, now seen corresponding path program 1 times [2024-10-18 21:38:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:38:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:38:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:38:36,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:38:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:38:53,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107 [2024-10-18 21:38:53,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:38:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:38:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash -592281196, now seen corresponding path program 1 times [2024-10-18 21:38:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:38:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308937176] [2024-10-18 21:38:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:38:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:38:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:38:53,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:38:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:38:53,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:38:53,128 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:38:53,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:38:53,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:38:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-10-18 21:38:53,130 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:38:53,131 WARN L239 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:38:53,131 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-10-18 21:38:53,186 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-10-18 21:38:53,190 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:38:53,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:38:53,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:38:53,192 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:38:53,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-10-18 21:38:53,256 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:38:53,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:38:53,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:38:53,257 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:38:53,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:39:04,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:39:04,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:39:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1764361062, now seen corresponding path program 1 times [2024-10-18 21:39:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:39:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801319952] [2024-10-18 21:39:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-18 21:39:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:39:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801319952] [2024-10-18 21:39:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801319952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:39:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:39:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:39:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921835066] [2024-10-18 21:39:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:39:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:39:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:39:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:39:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:39:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:39:04,311 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:39:04,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:39:04,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:39:07,704 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:39:07,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:39:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1422663538, now seen corresponding path program 1 times [2024-10-18 21:39:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:39:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:39:12,483 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:39:12,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 960 [2024-10-18 21:39:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1609573579, now seen corresponding path program 1 times [2024-10-18 21:39:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:39:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:39:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:39:31,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-10-18 21:39:31,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:39:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:39:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1737427696, now seen corresponding path program 1 times [2024-10-18 21:39:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:39:31,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007901784] [2024-10-18 21:39:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:39:31,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:39:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:39:31,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:39:31,798 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:39:31,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:39:31,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:39:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-10-18 21:39:31,801 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:39:31,801 WARN L239 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:39:31,801 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-10-18 21:39:31,862 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-10-18 21:39:31,867 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:39:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:39:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:39:31,870 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:39:31,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-10-18 21:39:31,937 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:39:31,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:39:31,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:39:31,938 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:39:31,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:39:44,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:39:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:39:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 6719446, now seen corresponding path program 1 times [2024-10-18 21:39:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:39:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116638682] [2024-10-18 21:39:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-18 21:39:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:39:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116638682] [2024-10-18 21:39:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116638682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:39:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:39:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:39:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800168906] [2024-10-18 21:39:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:39:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:39:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:39:44,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:39:44,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:39:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:39:44,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:39:44,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:39:44,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:39:47,383 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:39:47,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-10-18 21:39:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1518890905, now seen corresponding path program 1 times [2024-10-18 21:39:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:47,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-10-18 21:39:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:39:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:39:50,362 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:39:50,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:39:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1381736482, now seen corresponding path program 1 times [2024-10-18 21:39:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:50,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:50,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:39:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:39:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:39:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:39:50,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:39:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:40:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:40:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable118,SelfDestructingSolverStorable122 [2024-10-18 21:40:10,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:40:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:40:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 106223678, now seen corresponding path program 1 times [2024-10-18 21:40:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:40:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815271136] [2024-10-18 21:40:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:40:11,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:40:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:40:11,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:40:11,099 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:40:11,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:40:11,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:40:11,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-10-18 21:40:11,101 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:40:11,101 WARN L239 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:40:11,101 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-10-18 21:40:11,164 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-10-18 21:40:11,168 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:40:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:40:11,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:40:11,171 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:40:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-10-18 21:40:11,235 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:40:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:40:11,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:40:11,237 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:40:11,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:40:24,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:40:24,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:40:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1455119529, now seen corresponding path program 1 times [2024-10-18 21:40:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:40:24,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394504606] [2024-10-18 21:40:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:40:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-10-18 21:40:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:40:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394504606] [2024-10-18 21:40:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394504606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:40:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:40:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:40:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071279244] [2024-10-18 21:40:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:40:24,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:40:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:40:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:40:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:40:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:40:24,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:40:24,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:40:24,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:40:28,049 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:40:28,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:40:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1137668932, now seen corresponding path program 1 times [2024-10-18 21:40:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:40:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:40:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:40:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:40:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:40:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:40:30,965 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:40:30,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-10-18 21:40:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -92244542, now seen corresponding path program 1 times [2024-10-18 21:40:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:40:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:40:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:40:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:40:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:40:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:40:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:40:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2024-10-18 21:40:55,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:40:55,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:40:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1062110180, now seen corresponding path program 1 times [2024-10-18 21:40:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:40:55,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731109955] [2024-10-18 21:40:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:40:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:40:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:40:56,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:40:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:40:56,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:40:56,115 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:40:56,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:40:56,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:40:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-10-18 21:40:56,117 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:40:56,117 WARN L239 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:40:56,117 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-10-18 21:40:56,182 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-10-18 21:40:56,187 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:40:56,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:40:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:40:56,190 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:40:56,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-10-18 21:40:56,266 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:40:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:40:56,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:40:56,267 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:40:56,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:41:10,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:41:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:41:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -80665582, now seen corresponding path program 1 times [2024-10-18 21:41:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:41:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768639653] [2024-10-18 21:41:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-18 21:41:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:41:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768639653] [2024-10-18 21:41:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768639653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:41:10,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:41:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:41:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829505289] [2024-10-18 21:41:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:41:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:41:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:41:10,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:41:10,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:41:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:41:10,765 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:41:10,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:41:10,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:41:14,381 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:41:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 960 [2024-10-18 21:41:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 624008566, now seen corresponding path program 1 times [2024-10-18 21:41:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:41:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:41:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:41:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:41:17,507 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:41:17,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:41:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2037465733, now seen corresponding path program 1 times [2024-10-18 21:41:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:41:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:17,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-10-18 21:41:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:41:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:41:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:41:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134 [2024-10-18 21:41:42,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:41:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:41:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1968522431, now seen corresponding path program 1 times [2024-10-18 21:41:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:41:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486296848] [2024-10-18 21:41:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:41:42,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:41:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:41:42,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:41:42,974 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:41:42,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:41:42,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:41:42,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-10-18 21:41:42,976 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:41:42,977 WARN L239 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:41:42,977 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-10-18 21:41:43,043 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-10-18 21:41:43,048 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:41:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:41:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:41:43,051 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:41:43,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-10-18 21:41:43,126 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:41:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:41:43,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:41:43,127 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:41:43,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:41:58,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:41:58,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:41:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1666111416, now seen corresponding path program 1 times [2024-10-18 21:41:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:41:58,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739001944] [2024-10-18 21:41:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:41:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:41:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:41:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-10-18 21:41:58,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:41:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739001944] [2024-10-18 21:41:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739001944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:41:58,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:41:58,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:41:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393893022] [2024-10-18 21:41:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:41:58,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:41:58,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:41:58,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:41:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:41:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:41:58,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:41:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:41:58,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:42:02,421 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:42:02,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:42:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -713096349, now seen corresponding path program 1 times [2024-10-18 21:42:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:02,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:42:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:42:05,762 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:42:05,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-10-18 21:42:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1473883585, now seen corresponding path program 1 times [2024-10-18 21:42:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:42:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:42:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:42:32,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable136 [2024-10-18 21:42:32,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:42:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:42:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -187102101, now seen corresponding path program 1 times [2024-10-18 21:42:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:42:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124704630] [2024-10-18 21:42:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:42:32,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:42:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:42:32,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:42:32,653 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:42:32,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:42:32,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:42:32,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-10-18 21:42:32,655 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:42:32,655 WARN L239 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:42:32,656 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-10-18 21:42:32,715 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-10-18 21:42:32,719 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:42:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:42:32,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:42:32,721 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:42:32,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2024-10-18 21:42:32,794 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:42:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:42:32,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:42:32,795 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:42:32,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:42:49,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:42:49,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:42:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2143918240, now seen corresponding path program 1 times [2024-10-18 21:42:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:42:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422611628] [2024-10-18 21:42:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-18 21:42:49,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:42:49,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422611628] [2024-10-18 21:42:49,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422611628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:42:49,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:42:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:42:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251539513] [2024-10-18 21:42:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:42:49,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:42:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:42:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:42:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:42:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:42:49,822 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:42:49,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:42:49,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:42:53,824 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:42:53,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:42:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1012790898, now seen corresponding path program 1 times [2024-10-18 21:42:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:42:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:42:57,131 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:42:57,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2024-10-18 21:42:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1192218220, now seen corresponding path program 1 times [2024-10-18 21:42:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:42:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:42:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:42:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:42:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:42:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:43:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:43:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable146 [2024-10-18 21:43:27,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:43:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:43:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1897058419, now seen corresponding path program 1 times [2024-10-18 21:43:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:43:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908787538] [2024-10-18 21:43:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:43:27,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:43:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:43:27,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:43:27,522 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:43:27,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:43:27,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:43:27,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-10-18 21:43:27,524 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:43:27,524 WARN L239 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:43:27,524 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-10-18 21:43:27,583 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-10-18 21:43:27,588 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:43:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:43:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:43:27,591 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:43:27,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2024-10-18 21:43:27,658 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:43:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:43:27,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:43:27,659 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:43:27,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:43:44,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:43:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:43:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1288661887, now seen corresponding path program 1 times [2024-10-18 21:43:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:43:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532421540] [2024-10-18 21:43:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:43:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-18 21:43:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:43:45,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532421540] [2024-10-18 21:43:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532421540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:43:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:43:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:43:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974089407] [2024-10-18 21:43:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:43:45,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:43:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:43:45,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:43:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:43:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:43:45,223 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:43:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:43:45,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:43:48,937 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:43:48,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 942 [2024-10-18 21:43:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 646081066, now seen corresponding path program 1 times [2024-10-18 21:43:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:43:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:43:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:43:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:43:49,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:43:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:43:52,354 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:43:52,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2024-10-18 21:43:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash -814689924, now seen corresponding path program 1 times [2024-10-18 21:43:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:43:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:43:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:43:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:43:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:43:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:43:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:43:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:44:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:44:23,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149 [2024-10-18 21:44:23,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:44:23,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:44:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1297681475, now seen corresponding path program 1 times [2024-10-18 21:44:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:44:23,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472045153] [2024-10-18 21:44:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:44:23,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:44:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:44:23,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:44:23,834 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:44:23,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:44:23,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:44:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-10-18 21:44:23,835 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:44:23,835 WARN L239 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:44:23,835 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-10-18 21:44:23,898 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-10-18 21:44:23,903 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:44:23,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:44:23,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:44:23,906 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:44:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process [2024-10-18 21:44:23,979 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:44:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:44:23,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:44:23,980 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:44:23,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:44:42,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:44:42,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:44:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash -192588294, now seen corresponding path program 1 times [2024-10-18 21:44:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:44:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497123347] [2024-10-18 21:44:42,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:42,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:44:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2024-10-18 21:44:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:44:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497123347] [2024-10-18 21:44:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497123347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:44:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:44:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:44:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699283657] [2024-10-18 21:44:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:44:42,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:44:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:44:42,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:44:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:44:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:44:42,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:44:42,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:44:42,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:44:46,496 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:44:46,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 484 [2024-10-18 21:44:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 386368935, now seen corresponding path program 1 times [2024-10-18 21:44:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:44:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:44:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:44:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:44:46,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:44:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:44:49,959 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:44:49,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-10-18 21:44:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1451706494, now seen corresponding path program 1 times [2024-10-18 21:44:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:44:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:44:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:44:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:44:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:44:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:44:50,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:44:50,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:45:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:45:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-10-18 21:45:23,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:45:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:45:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1090631789, now seen corresponding path program 1 times [2024-10-18 21:45:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:45:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668015640] [2024-10-18 21:45:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:45:23,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:45:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:45:23,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:45:23,513 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:45:23,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:45:23,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:45:23,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-10-18 21:45:23,515 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:45:23,515 WARN L239 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:45:23,515 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-10-18 21:45:23,591 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-10-18 21:45:23,596 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:45:23,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:45:23,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:45:23,598 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:45:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2024-10-18 21:45:23,668 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:45:23,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:45:23,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:45:23,669 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:45:23,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 21:45:43,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:45:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:45:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 411232394, now seen corresponding path program 1 times [2024-10-18 21:45:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:45:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711944000] [2024-10-18 21:45:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:45:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2024-10-18 21:45:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:45:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711944000] [2024-10-18 21:45:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711944000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:45:43,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:45:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:45:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960799312] [2024-10-18 21:45:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:45:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 21:45:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:45:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 21:45:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 21:45:43,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:45:43,244 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:45:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:45:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:45:47,208 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:45:47,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 484 [2024-10-18 21:45:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2085397888, now seen corresponding path program 1 times [2024-10-18 21:45:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:45:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:45:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:45:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:45:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:45:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:45:50,775 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:45:50,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2024-10-18 21:45:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 615953789, now seen corresponding path program 1 times [2024-10-18 21:45:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:45:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:45:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:45:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:45:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:45:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 21:45:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:45:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-18 21:46:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:46:26,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable164,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161 [2024-10-18 21:46:26,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 21:46:26,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:46:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2079582567, now seen corresponding path program 1 times [2024-10-18 21:46:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:46:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864694252] [2024-10-18 21:46:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:46:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:46:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:46:26,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:46:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:46:26,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 21:46:26,868 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 21:46:26,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 21:46:26,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 21:46:26,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2024-10-18 21:46:26,870 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 21:46:26,870 WARN L239 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 21:46:26,870 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-10-18 21:46:26,946 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-10-18 21:46:26,951 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:46:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:46:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:46:26,953 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:46:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (31)] Waiting until timeout for monitored process [2024-10-18 21:46:27,031 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:46:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:46:27,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 21:46:27,031 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;@2d2adf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:46:27,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. Killed by 15