./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --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/weaver/popl20-bad-counter-queue.wvr.c -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 ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --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-19 04:31:51,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 04:31:51,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 04:31:51,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 04:31:51,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 04:31:51,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 04:31:51,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 04:31:51,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 04:31:51,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 04:31:51,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 04:31:51,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 04:31:51,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 04:31:51,206 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 04:31:51,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 04:31:51,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 04:31:51,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 04:31:51,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 04:31:51,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 04:31:51,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 04:31:51,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 04:31:51,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 04:31:51,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 04:31:51,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 04:31:51,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 04:31:51,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 04:31:51,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 04:31:51,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 04:31:51,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 04:31:51,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 04:31:51,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 04:31:51,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:31:51,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 04:31:51,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 04:31:51,217 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 04:31:51,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 04:31:51,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 04:31:51,218 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 04:31:51,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 04:31:51,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 04:31:51,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 04:31:51,219 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 04:31:51,220 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 -> ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 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 -> SLEEP_SET 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-19 04:31:51,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 04:31:51,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 04:31:51,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 04:31:51,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 04:31:51,510 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 04:31:51,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-10-19 04:31:52,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 04:31:53,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 04:31:53,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-10-19 04:31:53,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70ae16f4e/3b74089149f8490a804bc3bbf37431ef/FLAG963392866 [2024-10-19 04:31:53,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70ae16f4e/3b74089149f8490a804bc3bbf37431ef [2024-10-19 04:31:53,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 04:31:53,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 04:31:53,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 04:31:53,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 04:31:53,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 04:31:53,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5220851c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53, skipping insertion in model container [2024-10-19 04:31:53,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 04:31:53,398 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-10-19 04:31:53,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:31:53,422 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 04:31:53,439 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-10-19 04:31:53,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:31:53,459 INFO L204 MainTranslator]: Completed translation [2024-10-19 04:31:53,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53 WrapperNode [2024-10-19 04:31:53,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 04:31:53,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 04:31:53,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 04:31:53,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 04:31:53,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,514 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2024-10-19 04:31:53,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 04:31:53,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 04:31:53,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 04:31:53,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 04:31:53,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 04:31:53,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 04:31:53,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 04:31:53,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 04:31:53,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (1/1) ... [2024-10-19 04:31:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:31:53,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:31:53,581 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-19 04:31:53,587 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-19 04:31:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 04:31:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 04:31:53,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 04:31:53,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-19 04:31:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 04:31:53,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 04:31:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 04:31:53,627 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 04:31:53,728 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 04:31:53,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 04:31:53,965 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 04:31:53,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 04:31:54,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 04:31:54,226 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-19 04:31:54,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:31:54 BoogieIcfgContainer [2024-10-19 04:31:54,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 04:31:54,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 04:31:54,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 04:31:54,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 04:31:54,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 04:31:53" (1/3) ... [2024-10-19 04:31:54,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c97bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:31:54, skipping insertion in model container [2024-10-19 04:31:54,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:31:53" (2/3) ... [2024-10-19 04:31:54,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c97bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:31:54, skipping insertion in model container [2024-10-19 04:31:54,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:31:54" (3/3) ... [2024-10-19 04:31:54,239 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-10-19 04:31:54,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 04:31:54,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 04:31:54,257 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 04:31:54,304 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 04:31:54,354 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 04:31:54,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 04:31:54,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:31:54,357 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-19 04:31:54,358 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-19 04:31:54,442 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 04:31:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:31:54,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 04:31:54,466 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;@5e692a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 04:31:54,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-19 04:31:55,136 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 28 treesize of output 12 [2024-10-19 04:31:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 577922003, now seen corresponding path program 1 times [2024-10-19 04:31:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:55,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:31:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-19 04:31:56,094 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 28 treesize of output 12 [2024-10-19 04:31:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1760352330, now seen corresponding path program 1 times [2024-10-19 04:31:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:56,565 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 27 treesize of output 11 [2024-10-19 04:31:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1760359951, now seen corresponding path program 1 times [2024-10-19 04:31:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:56,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:31:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:31:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 541133813, now seen corresponding path program 1 times [2024-10-19 04:31:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:31:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334991006] [2024-10-19 04:31:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:31:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334991006] [2024-10-19 04:31:56,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334991006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:31:56,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844975750] [2024-10-19 04:31:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:31:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:31:56,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:31:56,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-19 04:31:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:57,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-19 04:31:57,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:31:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:57,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:31:57,193 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-19 04:31:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844975750] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-19 04:31:57,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-19 04:31:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-19 04:31:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654383396] [2024-10-19 04:31:57,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:31:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 04:31:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:31:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:31:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-19 04:31:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:57,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:31:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-19 04:31:57,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:57,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-19 04:31:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-19 04:31:57,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:31:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:31:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -50626629, now seen corresponding path program 1 times [2024-10-19 04:31:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:31:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668764317] [2024-10-19 04:31:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:31:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668764317] [2024-10-19 04:31:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668764317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:31:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918815973] [2024-10-19 04:31:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:31:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:31:57,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:31:57,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-19 04:31:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:57,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-19 04:31:57,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:31:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:57,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:31:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:57,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918815973] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:31:57,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:31:57,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-19 04:31:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732573147] [2024-10-19 04:31:57,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:31:57,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-19 04:31:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:31:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-19 04:31:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-19 04:31:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:57,932 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:31:57,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-19 04:31:57,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:57,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:58,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-19 04:31:58,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:31:58,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:31:58,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:31:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2144937319, now seen corresponding path program 2 times [2024-10-19 04:31:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:31:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992501965] [2024-10-19 04:31:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:31:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992501965] [2024-10-19 04:31:58,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992501965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:31:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748763459] [2024-10-19 04:31:58,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 04:31:58,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:31:58,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:31:58,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:31:58,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-19 04:31:58,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 04:31:58,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:31:58,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-19 04:31:58,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:31:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:58,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:31:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:31:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748763459] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:31:58,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:31:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-19 04:31:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595557282] [2024-10-19 04:31:58,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:31:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 04:31:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:31:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 04:31:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-19 04:31:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:58,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:31:58,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-19 04:31:58,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:58,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:58,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:31:58,941 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 28 treesize of output 12 [2024-10-19 04:31:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2070603610, now seen corresponding path program 1 times [2024-10-19 04:31:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:31:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:31:59,496 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 27 treesize of output 11 [2024-10-19 04:31:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2070611233, now seen corresponding path program 1 times [2024-10-19 04:31:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:31:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:31:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:31:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:31:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:31:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:31:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:31:59,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-19 04:32:00,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:00,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:32:00,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:32:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1257608609, now seen corresponding path program 3 times [2024-10-19 04:32:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:32:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678749666] [2024-10-19 04:32:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:32:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:32:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678749666] [2024-10-19 04:32:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678749666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:32:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370611697] [2024-10-19 04:32:00,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 04:32:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:32:00,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:32:00,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-19 04:32:00,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-19 04:32:00,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:32:00,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-19 04:32:00,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:32:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:32:00,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:32:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:32:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370611697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:32:00,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:32:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-19 04:32:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477387137] [2024-10-19 04:32:00,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:32:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-19 04:32:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:32:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-19 04:32:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-19 04:32:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:00,673 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:32:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-19 04:32:00,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:00,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:00,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:00,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:00,795 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 28 treesize of output 12 [2024-10-19 04:32:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1779787792, now seen corresponding path program 1 times [2024-10-19 04:32:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 04:32:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 04:32:01,308 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 27 treesize of output 11 [2024-10-19 04:32:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1779780169, now seen corresponding path program 1 times [2024-10-19 04:32:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 04:32:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 04:32:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:01,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-19 04:32:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-19 04:32:01,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:32:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:32:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1001679169, now seen corresponding path program 4 times [2024-10-19 04:32:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:32:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510822367] [2024-10-19 04:32:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:32:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:32:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510822367] [2024-10-19 04:32:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510822367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:32:02,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30308731] [2024-10-19 04:32:02,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-19 04:32:02,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:02,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:32:02,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:32:02,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-19 04:32:02,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-19 04:32:02,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:32:02,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-19 04:32:02,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:32:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-19 04:32:02,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:32:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-19 04:32:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30308731] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:32:02,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:32:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 19 [2024-10-19 04:32:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391459353] [2024-10-19 04:32:02,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:32:02,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-19 04:32:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:32:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-19 04:32:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-19 04:32:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:02,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:32:02,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-19 04:32:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:02,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:02,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:02,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:02,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:02,854 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 28 treesize of output 12 [2024-10-19 04:32:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash 240585052, now seen corresponding path program 1 times [2024-10-19 04:32:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 04:32:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 04:32:03,399 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 27 treesize of output 11 [2024-10-19 04:32:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 240577431, now seen corresponding path program 1 times [2024-10-19 04:32:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 04:32:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 04:32:03,891 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 27 treesize of output 11 [2024-10-19 04:32:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash 539186749, now seen corresponding path program 1 times [2024-10-19 04:32:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:32:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:04,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:32:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 04:32:04,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-19 04:32:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2024-10-19 04:32:04,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:32:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:32:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1561594448, now seen corresponding path program 5 times [2024-10-19 04:32:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:32:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863481747] [2024-10-19 04:32:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:32:05,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:32:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863481747] [2024-10-19 04:32:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863481747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:32:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56049429] [2024-10-19 04:32:05,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-19 04:32:05,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:05,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:32:05,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:32:05,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-19 04:32:05,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-19 04:32:05,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:32:05,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-19 04:32:05,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:32:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 04:32:05,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:32:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 04:32:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56049429] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:32:05,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:32:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 33 [2024-10-19 04:32:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738563903] [2024-10-19 04:32:05,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:32:05,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-19 04:32:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:32:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-19 04:32:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2024-10-19 04:32:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:05,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:32:05,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.911764705882353) internal successors, (133), 33 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-19 04:32:05,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:05,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:05,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:05,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:05,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 04:32:05,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 04:32:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:32:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-19 04:32:06,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-19 04:32:06,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:32:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:32:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2128906226, now seen corresponding path program 6 times [2024-10-19 04:32:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:32:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558324451] [2024-10-19 04:32:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:32:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 69 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-19 04:32:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:32:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558324451] [2024-10-19 04:32:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558324451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:32:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434797643] [2024-10-19 04:32:06,543 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-19 04:32:06,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:06,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:32:06,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:32:06,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-19 04:32:06,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-19 04:32:06,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:32:06,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-19 04:32:06,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:32:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 87 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:32:06,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:32:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 87 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 04:32:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434797643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:32:07,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:32:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2024-10-19 04:32:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769600536] [2024-10-19 04:32:07,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:32:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-19 04:32:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:32:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-19 04:32:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2024-10-19 04:32:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:07,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:32:07,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.151515151515151) internal successors, (137), 32 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-19 04:32:07,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:07,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:07,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:07,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 04:32:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:32:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 04:32:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:32:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:32:07,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-19 04:32:07,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:32:07,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 04:32:07,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:32:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1759265136, now seen corresponding path program 7 times [2024-10-19 04:32:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:32:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021034453] [2024-10-19 04:32:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:32:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:32:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:32:07,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:32:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:32:07,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 04:32:07,872 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 04:32:07,874 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-19 04:32:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-19 04:32:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-19 04:32:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-19 04:32:07,887 INFO L414 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 04:32:07,996 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 04:32:07,997 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 04:32:08,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 04:32:08 BasicIcfg [2024-10-19 04:32:08,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 04:32:08,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 04:32:08,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 04:32:08,002 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 04:32:08,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:31:54" (3/4) ... [2024-10-19 04:32:08,003 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 04:32:08,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 04:32:08,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 04:32:08,103 INFO L158 Benchmark]: Toolchain (without parser) took 14938.03ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 81.8MB in the beginning and 205.8MB in the end (delta: -124.0MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,103 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 04:32:08,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.59ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 68.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.08ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,104 INFO L158 Benchmark]: Boogie Preprocessor took 34.46ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 64.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 04:32:08,104 INFO L158 Benchmark]: RCFGBuilder took 676.42ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 64.6MB in the beginning and 143.3MB in the end (delta: -78.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,104 INFO L158 Benchmark]: TraceAbstraction took 13771.27ms. Allocated memory was 205.5MB in the beginning and 369.1MB in the end (delta: 163.6MB). Free memory was 142.3MB in the beginning and 220.5MB in the end (delta: -78.2MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,104 INFO L158 Benchmark]: Witness Printer took 100.66ms. Allocated memory is still 369.1MB. Free memory was 220.5MB in the beginning and 205.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-19 04:32:08,106 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.59ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 68.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.08ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.46ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 64.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 676.42ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 64.6MB in the beginning and 143.3MB in the end (delta: -78.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13771.27ms. Allocated memory was 205.5MB in the beginning and 369.1MB in the end (delta: 163.6MB). Free memory was 142.3MB in the beginning and 220.5MB in the end (delta: -78.2MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Witness Printer took 100.66ms. Allocated memory is still 369.1MB. Free memory was 220.5MB in the beginning and 205.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1924, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 361, dependent conditional: 349, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 279, dependent conditional: 255, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 209, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 209, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1499, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 1419, dependent conditional: 1008, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1842, independent: 1392, independent conditional: 555, independent unconditional: 837, dependent: 241, dependent conditional: 56, dependent unconditional: 185, unknown: 209, unknown conditional: 30, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 895, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 279, dependent conditional: 255, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 209, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 209, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1499, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 1419, dependent conditional: 1008, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1842, independent: 1392, independent conditional: 555, independent unconditional: 837, dependent: 241, dependent conditional: 56, dependent unconditional: 185, unknown: 209, unknown conditional: 30, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 895 ], Independence queries for same thread: 274, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 39, Number of trivial persistent sets: 28, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1924, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 361, dependent conditional: 349, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1650, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 87, dependent conditional: 75, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 279, dependent conditional: 255, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 209, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 209, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1499, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 1419, dependent conditional: 1008, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1842, independent: 1392, independent conditional: 555, independent unconditional: 837, dependent: 241, dependent conditional: 56, dependent unconditional: 185, unknown: 209, unknown conditional: 30, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 895, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 1281, independent unconditional: 282, dependent: 279, dependent conditional: 255, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1563, independent conditional: 555, independent unconditional: 1008, dependent: 279, dependent conditional: 86, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 209, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 209, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1499, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 1419, dependent conditional: 1008, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1842, independent: 1392, independent conditional: 555, independent unconditional: 837, dependent: 241, dependent conditional: 56, dependent unconditional: 185, unknown: 209, unknown conditional: 30, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 895 ], Independence queries for same thread: 274 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=0, size=5] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=1, size=5] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=2, size=5] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=3, size=5] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=4, size=5] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=5, \old(size)=5, arr={-4:0}, counter=0, i=5, size=5] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-4:0}, N=5, counter=0, t1=-2] [L49] 1 int i=0; VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-4:0}, N=5, counter=0, t1=-2, t2=-1] [L62] 2 int i=0; VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=0] [L49] 1 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=0] [L62] 2 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=9, i=1, tmp=9] [L49] 1 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=9, i=2] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L62] 2 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=2] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=11, i=2, tmp=11] [L49] 1 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=11, i=3] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=2, tmp=0] [L62] 2 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=3] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=3, tmp=3] [L62] 2 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=4] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=3, tmp=-3] [L49] 1 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=4] [L67] 2 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=-12, i=4, tmp=-12] [L62] 2 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=-12, i=5] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=4, tmp=3] [L49] 1 i++ VAL [A={-4:0}, N=5, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=5] [L62] COND FALSE 2 !(i