/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 00:20:07,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 00:20:07,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 00:20:07,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 00:20:07,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 00:20:07,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 00:20:07,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 00:20:07,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 00:20:07,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 00:20:07,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 00:20:07,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 00:20:07,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 00:20:07,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 00:20:07,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 00:20:07,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 00:20:07,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 00:20:07,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 00:20:07,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 00:20:07,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 00:20:07,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 00:20:07,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 00:20:07,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 00:20:07,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 00:20:07,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 00:20:07,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 00:20:07,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 00:20:07,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 00:20:07,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 00:20:07,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 00:20:07,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 00:20:07,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 00:20:07,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 00:20:07,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 00:20:07,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 00:20:07,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 00:20:07,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 00:20:07,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 00:20:07,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 00:20:07,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 00:20:07,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 00:20:07,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 00:20:07,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 00:20:07,799 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 00:20:07,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 00:20:07,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 00:20:07,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 00:20:07,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 00:20:07,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 00:20:07,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 00:20:07,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 00:20:07,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 00:20:07,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 00:20:07,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 00:20:07,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 00:20:07,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 00:20:07,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 00:20:07,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 00:20:07,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 00:20:07,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 00:20:07,804 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 00:20:07,805 INFO L138 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/UAutomizer-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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 00:20:08,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 00:20:08,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 00:20:08,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 00:20:08,030 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-04 00:20:08,030 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-04 00:20:08,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2023-05-04 00:20:08,031 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2023-05-04 00:20:08,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 00:20:08,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-05-04 00:20:08,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 00:20:08,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 00:20:08,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 00:20:08,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,096 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-05-04 00:20:08,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 00:20:08,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 00:20:08,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 00:20:08,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 00:20:08,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 00:20:08,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 00:20:08,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 00:20:08,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 00:20:08,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/1) ... [2023-05-04 00:20:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 00:20:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 00:20:08,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 00:20:08,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 00:20:08,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-05-04 00:20:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 00:20:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 00:20:08,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-05-04 00:20:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 00:20:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 00:20:08,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-04 00:20:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 00:20:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 00:20:08,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-05-04 00:20:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 00:20:08,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 00:20:08,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-05-04 00:20:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-05-04 00:20:08,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-05-04 00:20:08,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2023-05-04 00:20:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-05-04 00:20:08,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-05-04 00:20:08,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2023-05-04 00:20:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-05-04 00:20:08,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-05-04 00:20:08,184 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 00:20:08,223 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 00:20:08,225 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 00:20:08,343 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 00:20:08,373 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 00:20:08,374 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-04 00:20:08,375 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 12:20:08 BoogieIcfgContainer [2023-05-04 00:20:08,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 00:20:08,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 00:20:08,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 00:20:08,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 00:20:08,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 12:20:08" (1/2) ... [2023-05-04 00:20:08,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea97108 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 12:20:08, skipping insertion in model container [2023-05-04 00:20:08,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 12:20:08" (2/2) ... [2023-05-04 00:20:08,383 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2023-05-04 00:20:08,388 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 00:20:08,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 00:20:08,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 00:20:08,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 00:20:08,510 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-05-04 00:20:08,542 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 00:20:08,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 00:20:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 00:20:08,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 00:20:08,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 00:20:08,582 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 00:20:08,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2023-05-04 00:20:08,602 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@c40b3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 00:20:08,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 00:20:09,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 00:20:09,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-04 00:20:09,491 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-04 00:20:09,494 INFO L307 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2023-05-04 00:20:09,497 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 00:20:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 00:20:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 00:20:09,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 00:20:09,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 00:20:09,515 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 00:20:09,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 00:20:09,518 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@c40b3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 00:20:09,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 00:20:09,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1492472103, now seen corresponding path program 1 times [2023-05-04 00:20:09,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:09,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197275256] [2023-05-04 00:20:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-05-04 00:20:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197275256] [2023-05-04 00:20:09,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197275256] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:09,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:09,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898518270] [2023-05-04 00:20:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:09,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:09,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:09,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2023-05-04 00:20:09,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 00:20:10,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1421888882, now seen corresponding path program 2 times [2023-05-04 00:20:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195551730] [2023-05-04 00:20:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 00:20:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:10,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195551730] [2023-05-04 00:20:10,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195551730] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:10,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:10,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092310563] [2023-05-04 00:20:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:10,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,155 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:10,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2023-05-04 00:20:10,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 00:20:10,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1790154631, now seen corresponding path program 3 times [2023-05-04 00:20:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884252194] [2023-05-04 00:20:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 00:20:10,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:10,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884252194] [2023-05-04 00:20:10,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884252194] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:10,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:10,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766225308] [2023-05-04 00:20:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 00:20:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 00:20:10,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1310862517, now seen corresponding path program 4 times [2023-05-04 00:20:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226834191] [2023-05-04 00:20:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 00:20:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:10,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226834191] [2023-05-04 00:20:10,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226834191] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:10,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:10,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728882230] [2023-05-04 00:20:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:10,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 00:20:10,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 00:20:10,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1405896425, now seen corresponding path program 5 times [2023-05-04 00:20:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302865730] [2023-05-04 00:20:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 00:20:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302865730] [2023-05-04 00:20:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302865730] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:10,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:10,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891315392] [2023-05-04 00:20:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:10,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 00:20:10,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 00:20:10,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 146021339, now seen corresponding path program 6 times [2023-05-04 00:20:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090869339] [2023-05-04 00:20:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 00:20:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090869339] [2023-05-04 00:20:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090869339] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 00:20:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 00:20:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 00:20:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013129500] [2023-05-04 00:20:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 00:20:10,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 00:20:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 00:20:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 00:20:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:10,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:10,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 00:20:10,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash -427895129, now seen corresponding path program 7 times [2023-05-04 00:20:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:10,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886300519] [2023-05-04 00:20:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 00:20:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 00:20:11,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886300519] [2023-05-04 00:20:11,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886300519] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 00:20:11,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894964193] [2023-05-04 00:20:11,303 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-05-04 00:20:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 00:20:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 00:20:11,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 00:20:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 00:20:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 00:20:11,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2023-05-04 00:20:11,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 00:20:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 00:20:11,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 00:20:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 00:20:12,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894964193] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 00:20:12,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 00:20:12,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2023-05-04 00:20:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536778026] [2023-05-04 00:20:12,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 00:20:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-05-04 00:20:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 00:20:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-05-04 00:20:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2023-05-04 00:20:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:12,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 00:20:12,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 00:20:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 00:20:12,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 00:20:13,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 00:20:13,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 00:20:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 00:20:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963255, now seen corresponding path program 8 times [2023-05-04 00:20:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 00:20:13,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80545380] [2023-05-04 00:20:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 00:20:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 00:20:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 00:20:13,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 00:20:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 00:20:13,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 00:20:13,163 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 00:20:13,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-05-04 00:20:13,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 00:20:13,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 00:20:13,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 00:20:13,165 INFO L444 BasicCegarLoop]: Path program histogram: [8] [2023-05-04 00:20:13,166 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2023-05-04 00:20:13,168 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 00:20:13,168 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 00:20:13,192 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 12:20:13 BasicIcfg [2023-05-04 00:20:13,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 00:20:13,193 INFO L158 Benchmark]: Toolchain (without parser) took 5127.50ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 89.4MB in the beginning and 132.5MB in the end (delta: -43.2MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2023-05-04 00:20:13,193 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.6MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 00:20:13,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.11ms. Allocated memory is still 127.9MB. Free memory was 89.2MB in the beginning and 87.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 00:20:13,193 INFO L158 Benchmark]: Boogie Preprocessor took 24.42ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 00:20:13,194 INFO L158 Benchmark]: RCFGBuilder took 252.28ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 86.5MB in the beginning and 142.4MB in the end (delta: -56.0MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2023-05-04 00:20:13,194 INFO L158 Benchmark]: TraceAbstraction took 4814.78ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 141.3MB in the beginning and 132.5MB in the end (delta: 8.7MB). Peak memory consumption was 80.0MB. Max. memory is 8.0GB. [2023-05-04 00:20:13,195 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.6MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.11ms. Allocated memory is still 127.9MB. Free memory was 89.2MB in the beginning and 87.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.42ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.28ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 86.5MB in the beginning and 142.4MB in the end (delta: -56.0MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4814.78ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 141.3MB in the beginning and 132.5MB in the end (delta: 8.7MB). Peak memory consumption was 80.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19811, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 1688, dependent conditional: 1649, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3822, independent: 3783, independent conditional: 0, independent unconditional: 3783, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3822, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18547, independent: 14340, independent conditional: 0, independent unconditional: 14340, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 3822, unknown conditional: 0, unknown unconditional: 3822] , Statistics on independence cache: Total cache size (in pairs): 3822, Positive cache size: 3783, Positive conditional cache size: 0, Positive unconditional cache size: 3783, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1264 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2078, Number of trivial persistent sets: 1043, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4527, independent: 4488, independent conditional: 0, independent unconditional: 4488, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19811, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 1688, dependent conditional: 1649, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 13635, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18547, independent: 18123, independent conditional: 0, independent unconditional: 18123, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3822, independent: 3783, independent conditional: 0, independent unconditional: 3783, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3822, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18547, independent: 14340, independent conditional: 0, independent unconditional: 14340, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 3822, unknown conditional: 0, unknown unconditional: 3822] , Statistics on independence cache: Total cache size (in pairs): 3822, Positive cache size: 3783, Positive conditional cache size: 0, Positive unconditional cache size: 3783, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1264 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23955, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 1544, dependent conditional: 1492, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 985, dependent unconditional: 527, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4734, independent: 4674, independent conditional: 4, independent unconditional: 4670, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4734, independent: 4637, independent conditional: 0, independent unconditional: 4637, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 66, independent conditional: 3, independent unconditional: 63, dependent: 87, dependent conditional: 9, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23923, independent: 17737, independent conditional: 26, independent unconditional: 17711, dependent: 1452, dependent conditional: 117, dependent unconditional: 1335, unknown: 4734, unknown conditional: 12, unknown unconditional: 4722] , Statistics on independence cache: Total cache size (in pairs): 4734, Positive cache size: 4674, Positive conditional cache size: 4, Positive unconditional cache size: 4670, Negative cache size: 60, Negative conditional cache size: 8, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 860, Maximal queried relation: 5, Independence queries for same thread: 1047 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1068, Number of trivial persistent sets: 1062, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5732, independent: 5680, independent conditional: 0, independent unconditional: 5680, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23955, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 1544, dependent conditional: 1492, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 985, dependent unconditional: 527, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4734, independent: 4674, independent conditional: 4, independent unconditional: 4670, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4734, independent: 4637, independent conditional: 0, independent unconditional: 4637, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 66, independent conditional: 3, independent unconditional: 63, dependent: 87, dependent conditional: 9, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23923, independent: 17737, independent conditional: 26, independent unconditional: 17711, dependent: 1452, dependent conditional: 117, dependent unconditional: 1335, unknown: 4734, unknown conditional: 12, unknown unconditional: 4722] , Statistics on independence cache: Total cache size (in pairs): 4734, Positive cache size: 4674, Positive conditional cache size: 4, Positive unconditional cache size: 4670, Negative cache size: 60, Negative conditional cache size: 8, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 860, Maximal queried relation: 5, Independence queries for same thread: 1047 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L30] 3 temp_4 := x_0; VAL [f1_2=false, f2_3=false, temp_4=-3, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L31] 3 x_0 := temp_4 + 1; VAL [f1_2=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L32] 3 f1_2 := true; VAL [f1_2=true, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-3, y_9=-3] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-3, y_9=-3] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-3, y_9=-3] [L45] 5 temp_6 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-3, y_9=-3] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [L33] 3 assume f2_3; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [L34] 3 temp_5 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [L36] 3 f1_2 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L37] 3 assume !f2_3; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L66] JOIN 5 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L108] JOIN 4 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 1.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 2349 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 57/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-05-04 00:20:13,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-05-04 00:20:13,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 00:20:13,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...