./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version b86fb0b7
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-18 11:11:58,516 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-18 11:11:58,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-18 11:11:58,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-18 11:11:58,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-18 11:11:58,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-18 11:11:58,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-18 11:11:58,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-18 11:11:58,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-18 11:11:58,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-18 11:11:58,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-18 11:11:58,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-18 11:11:58,639 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-18 11:11:58,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-18 11:11:58,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-18 11:11:58,642 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-18 11:11:58,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-18 11:11:58,642 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-18 11:11:58,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-18 11:11:58,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-18 11:11:58,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-18 11:11:58,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-18 11:11:58,644 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-18 11:11:58,644 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-18 11:11:58,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-18 11:11:58,645 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-18 11:11:58,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-18 11:11:58,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-18 11:11:58,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-18 11:11:58,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-18 11:11:58,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 11:11:58,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-18 11:11:58,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-18 11:11:58,650 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-18 11:11:58,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-18 11:11:58,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-18 11:11:58,651 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-18 11:11:58,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-18 11:11:58,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-18 11:11:58,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-18 11:11:58,653 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-18 11:11:58,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET
[2024-10-18 11:11:58,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-18 11:11:58,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-18 11:11:58,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-18 11:11:58,953 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-18 11:11:58,953 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-18 11:11:58,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i
[2024-10-18 11:12:00,334 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-18 11:12:00,647 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-18 11:12:00,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i
[2024-10-18 11:12:00,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1de09e234/b4355f1c458e4f71850c0f00e09f86fb/FLAG33c3d80aa
[2024-10-18 11:12:00,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1de09e234/b4355f1c458e4f71850c0f00e09f86fb
[2024-10-18 11:12:00,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-18 11:12:00,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-18 11:12:00,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-18 11:12:00,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-18 11:12:00,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-18 11:12:00,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:12:00" (1/1) ...
[2024-10-18 11:12:00,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69493717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:00, skipping insertion in model container
[2024-10-18 11:12:00,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:12:00" (1/1) ...
[2024-10-18 11:12:01,001 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-18 11:12:01,213 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001]
[2024-10-18 11:12:01,449 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 11:12:01,461 INFO L200 MainTranslator]: Completed pre-run
[2024-10-18 11:12:01,474 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001]
[2024-10-18 11:12:01,543 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 11:12:01,587 INFO L204 MainTranslator]: Completed translation
[2024-10-18 11:12:01,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01 WrapperNode
[2024-10-18 11:12:01,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-18 11:12:01,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-18 11:12:01,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-18 11:12:01,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-18 11:12:01,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,658 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-10-18 11:12:01,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-18 11:12:01,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-18 11:12:01,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-18 11:12:01,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-18 11:12:01,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-18 11:12:01,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-18 11:12:01,718 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-18 11:12:01,718 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-18 11:12:01,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (1/1) ...
[2024-10-18 11:12:01,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 11:12:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 11:12:01,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-10-18 11:12:01,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-10-18 11:12:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-18 11:12:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-18 11:12:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-18 11:12:01,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-18 11:12:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-18 11:12:01,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-18 11:12:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-18 11:12:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-18 11:12:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-18 11:12:01,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-18 11:12:01,837 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-18 11:12:01,967 INFO L238 CfgBuilder]: Building ICFG
[2024-10-18 11:12:01,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-18 11:12:02,300 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-18 11:12:02,301 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-18 11:12:02,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-18 11:12:02,553 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-18 11:12:02,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:12:02 BoogieIcfgContainer
[2024-10-18 11:12:02,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-18 11:12:02,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-18 11:12:02,559 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-18 11:12:02,562 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-18 11:12:02,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 11:12:00" (1/3) ...
[2024-10-18 11:12:02,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eee8b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:12:02, skipping insertion in model container
[2024-10-18 11:12:02,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:12:01" (2/3) ...
[2024-10-18 11:12:02,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eee8b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:12:02, skipping insertion in model container
[2024-10-18 11:12:02,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:12:02" (3/3) ...
[2024-10-18 11:12:02,566 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i
[2024-10-18 11:12:02,584 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-18 11:12:02,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-18 11:12:02,584 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-18 11:12:02,635 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-18 11:12:02,685 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 11:12:02,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 11:12:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 11:12:02,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-10-18 11:12:02,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-10-18 11:12:02,787 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 11:12:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:12:02,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-18 11:12:02,814 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ddaa4af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-18 11:12:02,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2024-10-18 11:12:16,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-18 11:12:16,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:12:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2097108965, now seen corresponding path program 1 times
[2024-10-18 11:12:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:12:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476897607]
[2024-10-18 11:12:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:12:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:12:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:12:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-18 11:12:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:12:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476897607]
[2024-10-18 11:12:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476897607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:12:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:12:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-18 11:12:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884567472]
[2024-10-18 11:12:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:12:17,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 11:12:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:12:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 11:12:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-18 11:12:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:12:17,632 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:12:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 11:12:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:12:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-18 11:12:21,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-18 11:12:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:12:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1242888814, now seen corresponding path program 1 times
[2024-10-18 11:12:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:12:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392299182]
[2024-10-18 11:12:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:12:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:12:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:12:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-18 11:12:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:12:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392299182]
[2024-10-18 11:12:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392299182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:12:21,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:12:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-18 11:12:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587215729]
[2024-10-18 11:12:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:12:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-18 11:12:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:12:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-18 11:12:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-18 11:12:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:12:22,889 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:12:22,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 11:12:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:12:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:31,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-18 11:12:31,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-18 11:12:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:12:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1893978465, now seen corresponding path program 1 times
[2024-10-18 11:12:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:12:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633827714]
[2024-10-18 11:12:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:12:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:12:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:12:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-18 11:12:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:12:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633827714]
[2024-10-18 11:12:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633827714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:12:32,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:12:32,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 11:12:32,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130676941]
[2024-10-18 11:12:32,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:12:32,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 11:12:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:12:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1290022027, now seen corresponding path program 1 times
[2024-10-18 11:12:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:12:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:12:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:12:32,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:12:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:12:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 11:12:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-18 11:12:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:12:32,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:12:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 11:12:32,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:32,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:12:32,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:13:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:13:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:13:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 11:13:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2
[2024-10-18 11:13:24,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-18 11:13:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:13:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -388274245, now seen corresponding path program 2 times
[2024-10-18 11:13:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:13:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638285792]
[2024-10-18 11:13:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:13:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:13:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:13:24,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:13:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:13:24,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-18 11:13:24,663 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-18 11:13:24,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2024-10-18 11:13:24,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2024-10-18 11:13:24,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2024-10-18 11:13:24,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-18 11:13:24,678 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1]
[2024-10-18 11:13:24,681 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (1/2)
[2024-10-18 11:13:24,743 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-18 11:13:24,743 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-18 11:13:24,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 11:13:24 BasicIcfg
[2024-10-18 11:13:24,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-18 11:13:24,749 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-18 11:13:24,749 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-18 11:13:24,749 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-18 11:13:24,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:12:02" (3/4) ...
[2024-10-18 11:13:24,750 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-18 11:13:24,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-18 11:13:24,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-18 11:13:24,859 INFO L158 Benchmark]: Toolchain (without parser) took 83915.72ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 111.2MB in the beginning and 958.0MB in the end (delta: -846.8MB). Peak memory consumption was 214.4MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,862 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 11:13:24,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.87ms. Allocated memory is still 148.9MB. Free memory was 111.2MB in the beginning and 84.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.84ms. Allocated memory is still 148.9MB. Free memory was 84.1MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,863 INFO L158 Benchmark]: Boogie Preprocessor took 49.99ms. Allocated memory is still 148.9MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,863 INFO L158 Benchmark]: RCFGBuilder took 841.15ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 137.8MB in the end (delta: -58.5MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,863 INFO L158 Benchmark]: TraceAbstraction took 82190.22ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 136.7MB in the beginning and 968.5MB in the end (delta: -831.8MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,864 INFO L158 Benchmark]: Witness Printer took 109.32ms. Allocated memory is still 1.2GB. Free memory was 968.5MB in the beginning and 958.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-18 11:13:24,865 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 643.87ms. Allocated memory is still 148.9MB. Free memory was 111.2MB in the beginning and 84.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 73.84ms. Allocated memory is still 148.9MB. Free memory was 84.1MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 49.99ms. Allocated memory is still 148.9MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 841.15ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 137.8MB in the end (delta: -58.5MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 82190.22ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 136.7MB in the beginning and 968.5MB in the end (delta: -831.8MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB.
* Witness Printer took 109.32ms. Allocated memory is still 1.2GB. Free memory was 968.5MB in the beginning and 958.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 972, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 82, dependent conditional: 52, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 245, dependent conditional: 185, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 351, independent conditional: 5, independent unconditional: 346, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79273, independent: 1498, independent conditional: 1410, independent unconditional: 87, dependent: 77776, dependent conditional: 1509, dependent unconditional: 76267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1135, independent: 539, independent conditional: 37, independent unconditional: 502, dependent: 210, dependent conditional: 5, dependent unconditional: 205, unknown: 386, unknown conditional: 8, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 351, Positive conditional cache size: 5, Positive unconditional cache size: 346, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 679, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 245, dependent conditional: 185, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 351, independent conditional: 5, independent unconditional: 346, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79273, independent: 1498, independent conditional: 1410, independent unconditional: 87, dependent: 77776, dependent conditional: 1509, dependent unconditional: 76267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1135, independent: 539, independent conditional: 37, independent unconditional: 502, dependent: 210, dependent conditional: 5, dependent unconditional: 205, unknown: 386, unknown conditional: 8, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 351, Positive conditional cache size: 5, Positive unconditional cache size: 346, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 679 ], Independence queries for same thread: 14, Persistent sets #1 benchmarks: Persistent set computation time: 74.8s, Number of persistent set computation: 153, Number of trivial persistent sets: 92, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 972, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 82, dependent conditional: 52, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 958, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 245, dependent conditional: 185, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 351, independent conditional: 5, independent unconditional: 346, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79273, independent: 1498, independent conditional: 1410, independent unconditional: 87, dependent: 77776, dependent conditional: 1509, dependent unconditional: 76267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1135, independent: 539, independent conditional: 37, independent unconditional: 502, dependent: 210, dependent conditional: 5, dependent unconditional: 205, unknown: 386, unknown conditional: 8, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 351, Positive conditional cache size: 5, Positive unconditional cache size: 346, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 679, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 544, independent unconditional: 346, dependent: 245, dependent conditional: 185, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1135, independent: 890, independent conditional: 42, independent unconditional: 848, dependent: 245, dependent conditional: 8, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 351, independent conditional: 5, independent unconditional: 346, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79273, independent: 1498, independent conditional: 1410, independent unconditional: 87, dependent: 77776, dependent conditional: 1509, dependent unconditional: 76267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1135, independent: 539, independent conditional: 37, independent unconditional: 502, dependent: 210, dependent conditional: 5, dependent unconditional: 205, unknown: 386, unknown conditional: 8, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 351, Positive conditional cache size: 5, Positive unconditional cache size: 346, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 679 ], Independence queries for same thread: 14
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L718] 0 _Bool main$tmp_guard0;
[L719] 0 _Bool main$tmp_guard1;
[L721] 0 int x = 0;
[L723] 0 int y = 0;
[L724] 0 _Bool y$flush_delayed;
[L725] 0 int y$mem_tmp;
[L726] 0 _Bool y$r_buff0_thd0;
[L727] 0 _Bool y$r_buff0_thd1;
[L728] 0 _Bool y$r_buff0_thd2;
[L729] 0 _Bool y$r_buff1_thd0;
[L730] 0 _Bool y$r_buff1_thd1;
[L731] 0 _Bool y$r_buff1_thd2;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L831] 0 pthread_t t0;
[L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L833] 0 pthread_t t1;
[L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 1
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L754] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L755] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L756] 1 y$flush_delayed = weak$$choice2
[L757] 1 y$mem_tmp = y
[L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] 1 __unbuffered_p0_EAX = y
[L766] 1 y = y$flush_delayed ? y$mem_tmp : y
[L767] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L770] 1 __unbuffered_p0_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L787] 2 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L790] 2 __unbuffered_p1_EAX = x
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L793] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L794] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L795] 2 y$flush_delayed = weak$$choice2
[L796] 2 y$mem_tmp = y
[L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L804] 2 __unbuffered_p1_EBX = y
[L805] 2 y = y$flush_delayed ? y$mem_tmp : y
[L806] 2 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L818] 2 return 0;
[L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L838] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L838] RET 0 assume_abort_if_not(main$tmp_guard0)
[L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
- UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 5 procedures, 51 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 81.9s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 78.4s, 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: 16, 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.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 1.7s, ConditionalCommutativityCheckTime: 1.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 1, ConditionalCommutativityTraceChecks: 1, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-18 11:13:24,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0
[2024-10-18 11:13:25,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE