/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 '"3,2 1,1 2,2"' --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-03 19:37:58,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-03 19:37:58,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-03 19:37:58,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-03 19:37:58,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-03 19:37:58,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-03 19:37:58,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-03 19:37:58,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-03 19:37:58,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-03 19:37:58,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-03 19:37:58,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-03 19:37:58,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-03 19:37:58,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-03 19:37:58,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-03 19:37:58,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-03 19:37:58,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-03 19:37:58,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-03 19:37:58,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-03 19:37:58,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-03 19:37:58,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-03 19:37:58,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-03 19:37:58,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-03 19:37:58,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-03 19:37:58,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-03 19:37:58,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-03 19:37:58,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-03 19:37:58,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-03 19:37:58,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-03 19:37:58,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-03 19:37:58,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-03 19:37:58,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-03 19:37:58,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-03 19:37:58,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-03 19:37:58,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-03 19:37:58,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-03 19:37:58,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-03 19:37:58,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-03 19:37:58,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-03 19:37:58,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-03 19:37:58,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-03 19:37:58,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-03 19:37:58,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-03 19:37:58,506 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-03 19:37:58,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-03 19:37:58,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-03 19:37:58,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-03 19:37:58,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-03 19:37:58,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-03 19:37:58,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-03 19:37:58,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-03 19:37:58,508 INFO L138 SettingsManager]: * Use SBE=true [2023-05-03 19:37:58,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-03 19:37:58,508 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-03 19:37:58,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-03 19:37:58,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-03 19:37:58,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-03 19:37:58,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-03 19:37:58,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-03 19:37:58,512 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-03 19:37:58,512 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 -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-03 19:37:58,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-03 19:37:58,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-03 19:37:58,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-03 19:37:58,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-03 19:37:58,815 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-03 19:37:58,816 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-03 19:37:58,816 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-03 19:37:58,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-03 19:37:58,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-05-03 19:37:58,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-03 19:37:58,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-03 19:37:58,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-03 19:37:58,861 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 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,867 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 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,873 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-05-03 19:37:58,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-03 19:37:58,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-03 19:37:58,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-03 19:37:58,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-03 19:37:58,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-03 19:37:58,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-03 19:37:58,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-03 19:37:58,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-03 19:37:58,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/1) ... [2023-05-03 19:37:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-03 19:37:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 19:37:58,942 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-03 19:37:58,954 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-03 19:37:58,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-05-03 19:37:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-03 19:37:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-03 19:37:58,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-05-03 19:37:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-03 19:37:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-03 19:37:58,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-03 19:37:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-03 19:37:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-03 19:37:58,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-05-03 19:37:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-03 19:37:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-03 19:37:58,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-05-03 19:37:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-05-03 19:37:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-05-03 19:37:58,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2023-05-03 19:37:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-05-03 19:37:58,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-05-03 19:37:58,990 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2023-05-03 19:37:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-05-03 19:37:58,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-05-03 19:37:58,991 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-03 19:37:59,038 INFO L235 CfgBuilder]: Building ICFG [2023-05-03 19:37:59,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-03 19:37:59,170 INFO L276 CfgBuilder]: Performing block encoding [2023-05-03 19:37:59,182 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-03 19:37:59,183 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-03 19:37:59,185 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 07:37:59 BoogieIcfgContainer [2023-05-03 19:37:59,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-03 19:37:59,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-03 19:37:59,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-03 19:37:59,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-03 19:37:59,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 07:37:58" (1/2) ... [2023-05-03 19:37:59,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2149d731 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 07:37:59, skipping insertion in model container [2023-05-03 19:37:59,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 07:37:59" (2/2) ... [2023-05-03 19:37:59,213 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2023-05-03 19:37:59,220 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-03 19:37:59,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-03 19:37:59,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-03 19:37:59,247 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-03 19:37:59,345 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-05-03 19:37:59,385 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 19:37:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-03 19:37:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 19:37:59,390 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-03 19:37:59,413 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-03 19:37:59,452 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-03 19:37:59,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2023-05-03 19:37:59,487 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;@74617fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 19:37:59,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-03 19:38:01,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-03 19:38:01,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-03 19:38:01,262 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-03 19:38:01,265 INFO L307 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2023-05-03 19:38:01,275 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 19:38:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-03 19:38:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 19:38:01,280 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-03 19:38:01,289 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-03 19:38:01,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-03 19:38:01,291 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;@74617fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 19:38:01,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-03 19:38:01,311 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-03 19:38:01,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1668966560, now seen corresponding path program 1 times [2023-05-03 19:38:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:01,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037499176] [2023-05-03 19:38:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-05-03 19:38:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:01,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037499176] [2023-05-03 19:38:01,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037499176] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:01,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:01,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690761382] [2023-05-03 19:38:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:01,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:01,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:01,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:01,851 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-03 19:38:01,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:01,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-03 19:38:01,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -333714957, now seen corresponding path program 2 times [2023-05-03 19:38:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:01,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224120695] [2023-05-03 19:38:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-05-03 19:38:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224120695] [2023-05-03 19:38:02,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224120695] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:02,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183425260] [2023-05-03 19:38:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:02,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:02,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-03 19:38:02,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-03 19:38:02,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -113427144, now seen corresponding path program 3 times [2023-05-03 19:38:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:02,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323743966] [2023-05-03 19:38:02,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-05-03 19:38:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323743966] [2023-05-03 19:38:02,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323743966] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:02,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:02,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556242131] [2023-05-03 19:38:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:02,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:02,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-03 19:38:02,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-03 19:38:02,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -578546444, now seen corresponding path program 4 times [2023-05-03 19:38:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:02,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253212314] [2023-05-03 19:38:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-05-03 19:38:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253212314] [2023-05-03 19:38:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253212314] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:02,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:02,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074001575] [2023-05-03 19:38:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:02,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-03 19:38:02,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-03 19:38:02,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1225090648, now seen corresponding path program 5 times [2023-05-03 19:38:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:02,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581958626] [2023-05-03 19:38:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-05-03 19:38:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:02,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581958626] [2023-05-03 19:38:02,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581958626] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:02,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:02,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832533237] [2023-05-03 19:38:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:02,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:02,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:02,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:02,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03 19:38:02,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:02,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-03 19:38:03,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1563276446, now seen corresponding path program 1 times [2023-05-03 19:38:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:03,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681001497] [2023-05-03 19:38:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-03 19:38:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681001497] [2023-05-03 19:38:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681001497] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:03,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:03,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554748714] [2023-05-03 19:38:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:03,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:03,938 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:03,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-03 19:38:03,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-03 19:38:04,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash -159992076, now seen corresponding path program 2 times [2023-05-03 19:38:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:04,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300654801] [2023-05-03 19:38:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 19:38:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-03 19:38:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 19:38:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300654801] [2023-05-03 19:38:04,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300654801] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 19:38:04,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 19:38:04,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 19:38:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583839423] [2023-05-03 19:38:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 19:38:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 19:38:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 19:38:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 19:38:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 19:38:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:04,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 19:38:04,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 19:38:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-03 19:38:04,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 19:38:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 19:38:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 526296750, now seen corresponding path program 3 times [2023-05-03 19:38:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 19:38:04,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123723621] [2023-05-03 19:38:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 19:38:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 19:38:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-03 19:38:04,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-03 19:38:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-03 19:38:04,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-03 19:38:04,366 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-03 19:38:04,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-05-03 19:38:04,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-03 19:38:04,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-03 19:38:04,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-03 19:38:04,372 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3] [2023-05-03 19:38:04,373 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2023-05-03 19:38:04,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-03 19:38:04,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-03 19:38:04,430 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 07:38:04 BasicIcfg [2023-05-03 19:38:04,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-03 19:38:04,431 INFO L158 Benchmark]: Toolchain (without parser) took 5581.91ms. Allocated memory was 178.3MB in the beginning and 326.1MB in the end (delta: 147.8MB). Free memory was 139.6MB in the beginning and 129.5MB in the end (delta: 10.1MB). Peak memory consumption was 157.6MB. Max. memory is 8.0GB. [2023-05-03 19:38:04,431 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-03 19:38:04,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.71ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-03 19:38:04,432 INFO L158 Benchmark]: Boogie Preprocessor took 26.09ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-03 19:38:04,432 INFO L158 Benchmark]: RCFGBuilder took 283.10ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 126.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-05-03 19:38:04,432 INFO L158 Benchmark]: TraceAbstraction took 5228.08ms. Allocated memory was 178.3MB in the beginning and 326.1MB in the end (delta: 147.8MB). Free memory was 124.8MB in the beginning and 129.5MB in the end (delta: -4.8MB). Peak memory consumption was 142.9MB. Max. memory is 8.0GB. [2023-05-03 19:38:04,433 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 178.3MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.71ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.09ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.10ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 126.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5228.08ms. Allocated memory was 178.3MB in the beginning and 326.1MB in the end (delta: 147.8MB). Free memory was 124.8MB in the beginning and 129.5MB in the end (delta: -4.8MB). Peak memory consumption was 142.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 60410, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 9962, dependent conditional: 9923, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 1650, dependent conditional: 1611, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 1650, dependent conditional: 1611, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3852, independent: 3813, independent conditional: 0, independent unconditional: 3813, 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: 3852, independent: 3786, independent conditional: 0, independent unconditional: 3786, 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: 270, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 52098, independent: 46635, independent conditional: 0, independent unconditional: 46635, dependent: 1611, dependent conditional: 0, dependent unconditional: 1611, unknown: 3852, unknown conditional: 0, unknown unconditional: 3852] , Statistics on independence cache: Total cache size (in pairs): 3852, Positive cache size: 3813, Positive conditional cache size: 0, Positive unconditional cache size: 3813, 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: 8312 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.8s, Number of persistent set computation: 3226, Number of trivial persistent sets: 2095, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4601, independent: 4562, independent conditional: 0, independent unconditional: 4562, 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: 60410, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 9962, dependent conditional: 9923, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 1650, dependent conditional: 1611, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 45886, independent unconditional: 4562, dependent: 1650, dependent conditional: 1611, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52098, independent: 50448, independent conditional: 0, independent unconditional: 50448, dependent: 1650, dependent conditional: 0, dependent unconditional: 1650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3852, independent: 3813, independent conditional: 0, independent unconditional: 3813, 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: 3852, independent: 3786, independent conditional: 0, independent unconditional: 3786, 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: 270, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 52098, independent: 46635, independent conditional: 0, independent unconditional: 46635, dependent: 1611, dependent conditional: 0, dependent unconditional: 1611, unknown: 3852, unknown conditional: 0, unknown unconditional: 3852] , Statistics on independence cache: Total cache size (in pairs): 3852, Positive cache size: 3813, Positive conditional cache size: 0, Positive unconditional cache size: 3813, 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: 8312 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 71296, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 5887, dependent conditional: 5837, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66725, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 1316, dependent conditional: 1266, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66725, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 1316, dependent conditional: 1266, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 3901, dependent unconditional: 1510, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 497, dependent unconditional: 4914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 497, dependent unconditional: 4914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4622, independent: 4561, independent conditional: 3, independent unconditional: 4558, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4622, independent: 4525, independent conditional: 0, independent unconditional: 4525, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 67, independent conditional: 3, independent unconditional: 65, dependent: 150, dependent conditional: 15, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 70820, independent: 60848, independent conditional: 191, independent unconditional: 60657, dependent: 5350, dependent conditional: 486, dependent unconditional: 4864, unknown: 4622, unknown conditional: 14, unknown unconditional: 4608] , Statistics on independence cache: Total cache size (in pairs): 4622, Positive cache size: 4561, Positive conditional cache size: 3, Positive unconditional cache size: 4558, Negative cache size: 61, Negative conditional cache size: 11, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3404, Maximal queried relation: 4, Independence queries for same thread: 4571 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.7s, Number of persistent set computation: 7075, Number of trivial persistent sets: 7059, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5660, independent: 5610, independent conditional: 0, independent unconditional: 5610, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 71296, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 5887, dependent conditional: 5837, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66725, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 1316, dependent conditional: 1266, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66725, independent: 65409, independent conditional: 59799, independent unconditional: 5610, dependent: 1316, dependent conditional: 1266, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 3901, dependent unconditional: 1510, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 497, dependent unconditional: 4914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70820, independent: 65409, independent conditional: 194, independent unconditional: 65215, dependent: 5411, dependent conditional: 497, dependent unconditional: 4914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4622, independent: 4561, independent conditional: 3, independent unconditional: 4558, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4622, independent: 4525, independent conditional: 0, independent unconditional: 4525, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 67, independent conditional: 3, independent unconditional: 65, dependent: 150, dependent conditional: 15, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 70820, independent: 60848, independent conditional: 191, independent unconditional: 60657, dependent: 5350, dependent conditional: 486, dependent unconditional: 4864, unknown: 4622, unknown conditional: 14, unknown unconditional: 4608] , Statistics on independence cache: Total cache size (in pairs): 4622, Positive cache size: 4561, Positive conditional cache size: 3, Positive unconditional cache size: 4558, Negative cache size: 61, Negative conditional cache size: 11, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3404, Maximal queried relation: 4, Independence queries for same thread: 4571 - 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=-5, x_8=-5, y_1=-5, y_9=-5] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L30] 2 temp_4 := x_0; VAL [f1_2=false, f2_3=false, temp_4=-5, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L31] 2 x_0 := temp_4 + 1; VAL [f1_2=false, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L32] 2 f1_2 := true; VAL [f1_2=true, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=true, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L103] 3 f1_10 := false; [L104] 3 f2_11 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L106] FORK 3 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L107] FORK 3 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-4] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-4] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-4] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-4] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-3] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-3] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-3] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-3] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, x_0=-4, x_8=-3, y_1=-5, y_9=-3] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, x_0=-4, x_8=-3, y_1=-5, y_9=-3] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, x_0=-4, x_8=-3, y_1=-5, y_9=-3] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, x_0=-4, x_8=-3, y_1=-5, y_9=-3] [L45] 5 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, x_0=-4, x_8=-3, y_1=-5, y_9=-3] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, x_0=-4, x_8=-3, y_1=-4, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, x_0=-4, x_8=-3, y_1=-4, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, x_0=-4, x_8=-3, y_1=-4, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, temp_7=-4, x_0=-4, x_8=-3, y_1=-4, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-4, y_9=-3] [L33] 2 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-4, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-4, y_9=-3] [L34] 2 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-4, y_9=-3] [L35] 2 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L36] 2 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L45] 5 temp_6 := y_1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-3, y_1=-2, y_9=-3] [L37] 2 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-5, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-3, y_1=-2, y_9=-3] [L30] 2 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-3, y_1=-2, y_9=-3] [L31] 2 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L32] 2 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L108] JOIN 4 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L33] 2 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L34] 2 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L35] 2 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-1, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-1, y_9=-3] [L36] 2 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-1, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-3, y_1=-1, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L37] 2 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L45] 5 temp_6 := y_1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=0, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=0, y_9=-3] [L30] 2 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=0, y_9=-3] [L31] 2 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L32] 2 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=0, x_0=0, x_8=-3, y_1=0, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=0, y_9=-3] [L33] 2 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=0, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=0, y_9=-3] [L34] 2 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=0, y_9=-3] [L35] 2 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L36] 2 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L37] 2 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L65] JOIN 2 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L66] JOIN 5 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L119] JOIN 3 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [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=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] - 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: 1.8s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 1.7s, 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.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.2s, 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: 21, 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, 0.4s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 714 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 814/814 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-03 19:38:04,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-05-03 19:38:04,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-03 19:38:04,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...