./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 IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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 IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 13:28:43,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 13:28:43,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 13:28:43,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 13:28:43,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 13:28:43,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 13:28:43,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 13:28:43,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 13:28:43,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 13:28:43,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 13:28:43,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 13:28:43,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 13:28:43,554 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 13:28:43,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 13:28:43,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 13:28:43,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 13:28:43,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 13:28:43,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 13:28:43,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 13:28:43,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 13:28:43,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 13:28:43,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 13:28:43,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 13:28:43,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 13:28:43,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 13:28:43,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 13:28:43,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 13:28:43,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 13:28:43,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 13:28:43,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 13:28:43,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 13:28:43,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 13:28:43,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 13:28:43,563 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 13:28:43,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 13:28:43,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 13:28:43,564 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 13:28:43,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 13:28:43,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 13:28:43,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 13:28:43,564 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 13:28:43,565 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-18 13:28:43,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 13:28:43,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 13:28:43,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 13:28:43,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 13:28:43,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 13:28:43,770 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-18 13:28:44,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 13:28:45,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 13:28:45,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-10-18 13:28:45,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/672c13af6/4f41ef300408444a98f67300047d4306/FLAGf9aca8191 [2024-10-18 13:28:45,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/672c13af6/4f41ef300408444a98f67300047d4306 [2024-10-18 13:28:45,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 13:28:45,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 13:28:45,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 13:28:45,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 13:28:45,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 13:28:45,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e6e585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45, skipping insertion in model container [2024-10-18 13:28:45,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 13:28:45,693 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-18 13:28:45,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 13:28:45,716 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 13:28:45,731 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-18 13:28:45,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 13:28:45,746 INFO L204 MainTranslator]: Completed translation [2024-10-18 13:28:45,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45 WrapperNode [2024-10-18 13:28:45,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 13:28:45,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 13:28:45,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 13:28:45,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 13:28:45,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,774 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2024-10-18 13:28:45,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 13:28:45,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 13:28:45,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 13:28:45,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 13:28:45,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 13:28:45,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 13:28:45,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 13:28:45,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 13:28:45,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (1/1) ... [2024-10-18 13:28:45,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 13:28:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:45,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 13:28:45,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 13:28:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 13:28:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 13:28:45,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 13:28:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 13:28:45,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 13:28:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 13:28:45,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 13:28:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 13:28:45,879 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 13:28:45,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 13:28:45,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 13:28:46,153 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 13:28:46,156 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 13:28:46,344 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 13:28:46,346 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-18 13:28:46,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 01:28:46 BoogieIcfgContainer [2024-10-18 13:28:46,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 13:28:46,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 13:28:46,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 13:28:46,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 13:28:46,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 01:28:45" (1/3) ... [2024-10-18 13:28:46,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66af65df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 01:28:46, skipping insertion in model container [2024-10-18 13:28:46,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 01:28:45" (2/3) ... [2024-10-18 13:28:46,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66af65df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 01:28:46, skipping insertion in model container [2024-10-18 13:28:46,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 01:28:46" (3/3) ... [2024-10-18 13:28:46,354 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-10-18 13:28:46,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 13:28:46,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 13:28:46,367 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 13:28:46,400 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 13:28:46,435 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 13:28:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 13:28:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:46,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 13:28:46,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 13:28:46,498 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 13:28:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:46,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 13:28:46,518 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;@348a71ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 13:28:46,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-18 13:28:46,923 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-18 13:28:46,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1354872979, now seen corresponding path program 1 times [2024-10-18 13:28:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504249019] [2024-10-18 13:28:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:47,260 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-18 13:28:47,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504249019] [2024-10-18 13:28:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504249019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 13:28:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 13:28:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 13:28:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86395783] [2024-10-18 13:28:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 13:28:47,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 13:28:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:47,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 13:28:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-18 13:28:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:47,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:47,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 13:28:47,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:47,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 13:28:47,355 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-18 13:28:47,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 541133813, now seen corresponding path program 1 times [2024-10-18 13:28:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:47,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6446604] [2024-10-18 13:28:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:47,490 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-18 13:28:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6446604] [2024-10-18 13:28:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6446604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160980757] [2024-10-18 13:28:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:47,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:47,504 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-18 13:28:47,505 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-18 13:28:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:47,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 13:28:47,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:47,655 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-18 13:28:47,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 13:28:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160980757] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-18 13:28:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-18 13:28:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878565207] [2024-10-18 13:28:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 13:28:47,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 13:28:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 13:28:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-18 13:28:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:47,716 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:47,716 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-18 13:28:47,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:47,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:47,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 13:28:47,988 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,SelfDestructingSolverStorable1 [2024-10-18 13:28:47,989 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-18 13:28:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -50626629, now seen corresponding path program 1 times [2024-10-18 13:28:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763052930] [2024-10-18 13:28:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:48,119 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-18 13:28:48,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763052930] [2024-10-18 13:28:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763052930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650925584] [2024-10-18 13:28:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:48,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:48,122 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-18 13:28:48,123 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-18 13:28:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:48,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-18 13:28:48,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:48,279 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-18 13:28:48,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:48,341 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-18 13:28:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650925584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 13:28:48,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 13:28:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-18 13:28:48,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884831792] [2024-10-18 13:28:48,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 13:28:48,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 13:28:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 13:28:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-18 13:28:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:48,355 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:48,355 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-18 13:28:48,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:48,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:48,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:48,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 13:28:48,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:48,653 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-18 13:28:48,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2144937319, now seen corresponding path program 2 times [2024-10-18 13:28:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:48,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526287666] [2024-10-18 13:28:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:48,762 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-18 13:28:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526287666] [2024-10-18 13:28:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526287666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937801693] [2024-10-18 13:28:48,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 13:28:48,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:48,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:48,765 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-18 13:28:48,766 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-18 13:28:48,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 13:28:48,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 13:28:48,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-18 13:28:48,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:48,906 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-18 13:28:48,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:48,978 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-18 13:28:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937801693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 13:28:48,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 13:28:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-18 13:28:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735796591] [2024-10-18 13:28:48,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 13:28:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-18 13:28:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 13:28:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-18 13:28:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:48,991 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:48,991 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-18 13:28:48,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:48,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:48,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:48,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:49,212 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-18 13:28:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:49,401 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-18 13:28:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1257608609, now seen corresponding path program 3 times [2024-10-18 13:28:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789805029] [2024-10-18 13:28:49,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:49,553 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-18 13:28:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789805029] [2024-10-18 13:28:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789805029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963461957] [2024-10-18 13:28:49,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 13:28:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:49,557 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-18 13:28:49,558 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-18 13:28:49,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-18 13:28:49,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 13:28:49,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 13:28:49,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:49,743 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-18 13:28:49,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:49,842 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-18 13:28:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963461957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 13:28:49,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 13:28:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-18 13:28:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363646718] [2024-10-18 13:28:49,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 13:28:49,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-18 13:28:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-18 13:28:49,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-18 13:28:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:49,854 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:49,854 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-18 13:28:49,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:49,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:49,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 13:28:49,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-18 13:28:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:50,152 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-18 13:28:50,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1001679169, now seen corresponding path program 4 times [2024-10-18 13:28:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662830473] [2024-10-18 13:28:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:50,290 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-18 13:28:50,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662830473] [2024-10-18 13:28:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662830473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646503670] [2024-10-18 13:28:50,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 13:28:50,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:50,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:50,292 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-18 13:28:50,294 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-18 13:28:50,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 13:28:50,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 13:28:50,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-18 13:28:50,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:50,489 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-18 13:28:50,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:50,552 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-18 13:28:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646503670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 13:28:50,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 13:28:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 19 [2024-10-18 13:28:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046478154] [2024-10-18 13:28:50,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 13:28:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-18 13:28:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-18 13:28:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-18 13:28:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:50,558 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:50,558 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-18 13:28:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:50,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 13:28:50,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 13:28:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 13:28:51,193 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-18 13:28:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:51,384 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-18 13:28:51,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1561594448, now seen corresponding path program 5 times [2024-10-18 13:28:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860152628] [2024-10-18 13:28:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 13:28:51,746 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-18 13:28:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 13:28:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860152628] [2024-10-18 13:28:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860152628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 13:28:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539927948] [2024-10-18 13:28:51,750 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 13:28:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 13:28:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 13:28:51,752 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-18 13:28:51,753 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-18 13:28:51,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-18 13:28:51,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 13:28:51,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-18 13:28:51,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 13:28:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 13:28:52,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 13:28:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 13:28:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539927948] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 13:28:52,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 13:28:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 36 [2024-10-18 13:28:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835468952] [2024-10-18 13:28:52,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 13:28:52,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 13:28:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 13:28:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 13:28:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2024-10-18 13:28:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:52,359 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 13:28:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.891891891891892) internal successors, (144), 36 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 13:28:52,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:52,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:52,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 13:28:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-18 13:28:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 13:28:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 13:28:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 13:28:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 13:28:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 13:28:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 13:28:52,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-18 13:28:52,679 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,SelfDestructingSolverStorable6 [2024-10-18 13:28:52,680 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-18 13:28:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 13:28:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1759265136, now seen corresponding path program 6 times [2024-10-18 13:28:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 13:28:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255784162] [2024-10-18 13:28:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 13:28:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 13:28:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 13:28:52,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 13:28:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 13:28:52,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 13:28:52,805 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 13:28:52,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-18 13:28:52,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-18 13:28:52,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-18 13:28:52,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 13:28:52,815 INFO L414 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-10-18 13:28:52,885 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-18 13:28:52,885 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-18 13:28:52,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 01:28:52 BasicIcfg [2024-10-18 13:28:52,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-18 13:28:52,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-18 13:28:52,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-18 13:28:52,888 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-18 13:28:52,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 01:28:46" (3/4) ... [2024-10-18 13:28:52,889 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-18 13:28:52,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-18 13:28:52,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-18 13:28:52,954 INFO L158 Benchmark]: Toolchain (without parser) took 7431.77ms. Allocated memory was 153.1MB in the beginning and 287.3MB in the end (delta: 134.2MB). Free memory was 98.4MB in the beginning and 162.9MB in the end (delta: -64.5MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 13:28:52,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.40ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 84.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.87ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,955 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 81.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,955 INFO L158 Benchmark]: RCFGBuilder took 531.33ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 101.3MB in the end (delta: -20.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,955 INFO L158 Benchmark]: TraceAbstraction took 6539.42ms. Allocated memory was 153.1MB in the beginning and 287.3MB in the end (delta: 134.2MB). Free memory was 100.8MB in the beginning and 177.6MB in the end (delta: -76.9MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,956 INFO L158 Benchmark]: Witness Printer took 66.08ms. Allocated memory is still 287.3MB. Free memory was 177.6MB in the beginning and 162.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-18 13:28:52,957 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.15ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.40ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 84.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.87ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 81.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.33ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 101.3MB in the end (delta: -20.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6539.42ms. Allocated memory was 153.1MB in the beginning and 287.3MB in the end (delta: 134.2MB). Free memory was 100.8MB in the beginning and 177.6MB in the end (delta: -76.9MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Witness Printer took 66.08ms. Allocated memory is still 287.3MB. Free memory was 177.6MB in the beginning and 162.9MB 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: 1398, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 272, dependent conditional: 264, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 157, dependent conditional: 141, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 192, independent: 174, independent conditional: 3, independent unconditional: 171, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 692, independent: 132, independent conditional: 71, independent unconditional: 61, dependent: 559, dependent conditional: 271, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1283, independent: 952, independent conditional: 326, independent unconditional: 626, dependent: 139, dependent conditional: 22, dependent unconditional: 117, unknown: 192, unknown conditional: 13, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 174, Positive conditional cache size: 3, Positive unconditional cache size: 171, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 711, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 157, dependent conditional: 141, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 192, independent: 174, independent conditional: 3, independent unconditional: 171, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 692, independent: 132, independent conditional: 71, independent unconditional: 61, dependent: 559, dependent conditional: 271, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1283, independent: 952, independent conditional: 326, independent unconditional: 626, dependent: 139, dependent conditional: 22, dependent unconditional: 117, unknown: 192, unknown conditional: 13, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 174, Positive conditional cache size: 3, Positive unconditional cache size: 171, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 711 ], Independence queries for same thread: 231, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, 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: 1398, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 272, dependent conditional: 264, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1167, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 157, dependent conditional: 141, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 192, independent: 174, independent conditional: 3, independent unconditional: 171, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 692, independent: 132, independent conditional: 71, independent unconditional: 61, dependent: 559, dependent conditional: 271, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1283, independent: 952, independent conditional: 326, independent unconditional: 626, dependent: 139, dependent conditional: 22, dependent unconditional: 117, unknown: 192, unknown conditional: 13, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 174, Positive conditional cache size: 3, Positive unconditional cache size: 171, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 711, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 931, independent unconditional: 195, dependent: 157, dependent conditional: 141, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1283, independent: 1126, independent conditional: 329, independent unconditional: 797, dependent: 157, dependent conditional: 32, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 192, independent: 174, independent conditional: 3, independent unconditional: 171, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 692, independent: 132, independent conditional: 71, independent unconditional: 61, dependent: 559, dependent conditional: 271, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1283, independent: 952, independent conditional: 326, independent unconditional: 626, dependent: 139, dependent conditional: 22, dependent unconditional: 117, unknown: 192, unknown conditional: 13, unknown unconditional: 179] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 174, Positive conditional cache size: 3, Positive unconditional cache size: 171, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 711 ], Independence queries for same thread: 231 - 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