./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix050.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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/mix050.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 a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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 04:12:33,705 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-18 04:12:33,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-18 04:12:33,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-18 04:12:33,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-18 04:12:33,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-18 04:12:33,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-18 04:12:33,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-18 04:12:33,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-18 04:12:33,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-18 04:12:33,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-18 04:12:33,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-18 04:12:33,828 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-18 04:12:33,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-18 04:12:33,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-18 04:12:33,831 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-18 04:12:33,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-18 04:12:33,831 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-18 04:12:33,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-18 04:12:33,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-18 04:12:33,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-18 04:12:33,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-18 04:12:33,837 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-18 04:12:33,837 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-18 04:12:33,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-18 04:12:33,838 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-18 04:12:33,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-18 04:12:33,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-18 04:12:33,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-18 04:12:33,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-18 04:12:33,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 04:12:33,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-18 04:12:33,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-18 04:12:33,839 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-18 04:12:33,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-18 04:12:33,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-18 04:12:33,840 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-18 04:12:33,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-18 04:12:33,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-18 04:12:33,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-18 04:12:33,843 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-18 04:12:33,843 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 -> a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d
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 -> COUNTEREXAMPLE
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 50
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213
[2024-10-18 04:12:34,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-18 04:12:34,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-18 04:12:34,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-18 04:12:34,127 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-18 04:12:34,128 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-18 04:12:34,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i
[2024-10-18 04:12:35,603 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-18 04:12:35,869 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-18 04:12:35,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i
[2024-10-18 04:12:35,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0da764420/4652ac4bda6e45a2b7382e0ed6c57d79/FLAG0c619ae12
[2024-10-18 04:12:35,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0da764420/4652ac4bda6e45a2b7382e0ed6c57d79
[2024-10-18 04:12:35,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-18 04:12:35,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-18 04:12:35,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-18 04:12:35,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-18 04:12:35,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-18 04:12:35,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 04:12:35" (1/1) ...
[2024-10-18 04:12:35,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef94998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:35, skipping insertion in model container
[2024-10-18 04:12:35,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 04:12:35" (1/1) ...
[2024-10-18 04:12:35,973 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-18 04:12:36,178 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/mix050.i[940,953]
[2024-10-18 04:12:36,431 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 04:12:36,450 INFO L200 MainTranslator]: Completed pre-run
[2024-10-18 04:12:36,464 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/mix050.i[940,953]
[2024-10-18 04:12:36,560 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 04:12:36,626 INFO L204 MainTranslator]: Completed translation
[2024-10-18 04:12:36,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36 WrapperNode
[2024-10-18 04:12:36,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-18 04:12:36,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-18 04:12:36,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-18 04:12:36,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-18 04:12:36,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,702 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-10-18 04:12:36,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-18 04:12:36,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-18 04:12:36,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-18 04:12:36,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-18 04:12:36,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-18 04:12:36,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-18 04:12:36,754 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-18 04:12:36,754 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-18 04:12:36,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (1/1) ...
[2024-10-18 04:12:36,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 04:12:36,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 04:12:36,795 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 04:12:36,801 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 04:12:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-18 04:12:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-18 04:12:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-18 04:12:36,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-18 04:12:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-18 04:12:36,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-18 04:12:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-10-18 04:12:36,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-10-18 04:12:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-10-18 04:12:36,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-10-18 04:12:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-18 04:12:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-18 04:12:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-18 04:12:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-18 04:12:36,857 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 04:12:37,020 INFO L238 CfgBuilder]: Building ICFG
[2024-10-18 04:12:37,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-18 04:12:37,375 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-18 04:12:37,375 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-18 04:12:37,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-18 04:12:37,597 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-18 04:12:37,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 04:12:37 BoogieIcfgContainer
[2024-10-18 04:12:37,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-18 04:12:37,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-18 04:12:37,602 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-18 04:12:37,606 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-18 04:12:37,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 04:12:35" (1/3) ...
[2024-10-18 04:12:37,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6b9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 04:12:37, skipping insertion in model container
[2024-10-18 04:12:37,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 04:12:36" (2/3) ...
[2024-10-18 04:12:37,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6b9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 04:12:37, skipping insertion in model container
[2024-10-18 04:12:37,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 04:12:37" (3/3) ...
[2024-10-18 04:12:37,610 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i
[2024-10-18 04:12:37,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-18 04:12:37,629 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-18 04:12:37,629 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-18 04:12:37,697 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-18 04:12:37,748 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 04:12:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 04:12:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 04:12:37,751 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 04:12:37,753 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 04:12:37,860 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 04:12:37,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:12:37,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-18 04:12:37,890 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;@344ba17c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false
[2024-10-18 04:12:37,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-10-18 04:13:11,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:13:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:13:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1183878599, now seen corresponding path program 1 times
[2024-10-18 04:13:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:13:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855629815]
[2024-10-18 04:13:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:13:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:13:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 04:13:12,173 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 04:13:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 04:13:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855629815]
[2024-10-18 04:13:12,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855629815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 04:13:12,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 04:13:12,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 04:13:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171642515]
[2024-10-18 04:13:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 04:13:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-18 04:13:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 04:13:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-18 04:13:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-18 04:13:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:13:12,216 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 04:13:12,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 04:13:12,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:13:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:13:15,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-18 04:13:15,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:13:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:13:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1627728389, now seen corresponding path program 1 times
[2024-10-18 04:13:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:13:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979921474]
[2024-10-18 04:13:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:13:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:13:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 04:13:16,312 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 04:13:16,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 04:13:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979921474]
[2024-10-18 04:13:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979921474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 04:13:16,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 04:13:16,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 04:13:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146573958]
[2024-10-18 04:13:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 04:13:16,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 04:13:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 04:13:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 04:13:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-18 04:13:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:13:16,319 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 04:13:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 04:13:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:13:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-18 04:14:14,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:14:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:14:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1271148171, now seen corresponding path program 2 times
[2024-10-18 04:14:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:14:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71578552]
[2024-10-18 04:14:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 04:14:15,314 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 04:14:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 04:14:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71578552]
[2024-10-18 04:14:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71578552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 04:14:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 04:14:15,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 04:14:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733185447]
[2024-10-18 04:14:15,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 04:14:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 04:14:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 04:14:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 04:14:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-18 04:14:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:15,318 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 04:14:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 04:14:15,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:15,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:15,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:16,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-18 04:14:16,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:14:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1417217696, now seen corresponding path program 1 times
[2024-10-18 04:14:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:16,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 04:14:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:16,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:14:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 612297623, now seen corresponding path program 3 times
[2024-10-18 04:14:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:14:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977886571]
[2024-10-18 04:14:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 04:14:17,327 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 04:14:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 04:14:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977886571]
[2024-10-18 04:14:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977886571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 04:14:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 04:14:17,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 04:14:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177004409]
[2024-10-18 04:14:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 04:14:17,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 04:14:17,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 04:14:17,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 04:14:17,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-18 04:14:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:17,331 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 04:14:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 04:14:17,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:17,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:17,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:17,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3
[2024-10-18 04:14:18,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:14:18,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1809852250, now seen corresponding path program 1 times
[2024-10-18 04:14:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:18,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 04:14:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:14:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1689208297, now seen corresponding path program 4 times
[2024-10-18 04:14:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:14:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451060712]
[2024-10-18 04:14:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 04:14:18,797 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 04:14:18,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 04:14:18,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451060712]
[2024-10-18 04:14:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451060712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 04:14:18,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 04:14:18,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-18 04:14:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709526032]
[2024-10-18 04:14:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 04:14:18,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-18 04:14:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 04:14:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-18 04:14:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-10-18 04:14:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:18,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 04:14:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 04:14:18,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 04:14:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 04:14:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 04:14:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-18 04:14:20,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 04:14:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1027243319, now seen corresponding path program 1 times
[2024-10-18 04:14:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:20,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 04:14:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 04:14:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1645403391, now seen corresponding path program 5 times
[2024-10-18 04:14:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 04:14:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824912688]
[2024-10-18 04:14:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 04:14:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 04:14:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:20,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 04:14:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 04:14:20,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-18 04:14:20,430 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-18 04:14:20,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-10-18 04:14:20,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining)
[2024-10-18 04:14:20,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-10-18 04:14:20,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-10-18 04:14:20,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-10-18 04:14:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7
[2024-10-18 04:14:20,449 INFO L414 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1]
[2024-10-18 04:14:20,453 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-10-18 04:14:20,568 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-18 04:14:20,569 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-18 04:14:20,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 04:14:20 BasicIcfg
[2024-10-18 04:14:20,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-18 04:14:20,572 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-18 04:14:20,573 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-18 04:14:20,573 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-18 04:14:20,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 04:12:37" (3/4) ...
[2024-10-18 04:14:20,574 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-18 04:14:20,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-18 04:14:20,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-18 04:14:20,680 INFO L158 Benchmark]: Toolchain (without parser) took 104768.39ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 74.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,681 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 04:14:20,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.75ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 73.8MB in the beginning and 149.2MB in the end (delta: -75.3MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.58ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 146.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,681 INFO L158 Benchmark]: Boogie Preprocessor took 48.79ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 143.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,682 INFO L158 Benchmark]: RCFGBuilder took 844.05ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 87.3MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,682 INFO L158 Benchmark]: TraceAbstraction took 102970.63ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,682 INFO L158 Benchmark]: Witness Printer took 107.44ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-10-18 04:14:20,684 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.14ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 711.75ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 73.8MB in the beginning and 149.2MB in the end (delta: -75.3MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 74.58ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 146.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 48.79ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 143.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 844.05ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 87.3MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 102970.63ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
* Witness Printer took 107.44ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: 353947, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 24140, dependent conditional: 24085, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 162640, dependent conditional: 162532, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1207, independent: 1143, independent conditional: 21, independent unconditional: 1122, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93582, independent: 711, independent conditional: 383, independent unconditional: 328, dependent: 92871, dependent conditional: 117, dependent unconditional: 92754, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 492447, independent: 328664, independent conditional: 12497, independent unconditional: 316167, dependent: 162576, dependent conditional: 329, dependent unconditional: 162247, unknown: 1207, unknown conditional: 27, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1143, Positive conditional cache size: 21, Positive unconditional cache size: 1122, Negative cache size: 64, Negative conditional cache size: 6, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478364, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 162640, dependent conditional: 162532, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1207, independent: 1143, independent conditional: 21, independent unconditional: 1122, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93582, independent: 711, independent conditional: 383, independent unconditional: 328, dependent: 92871, dependent conditional: 117, dependent unconditional: 92754, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 492447, independent: 328664, independent conditional: 12497, independent unconditional: 316167, dependent: 162576, dependent conditional: 329, dependent unconditional: 162247, unknown: 1207, unknown conditional: 27, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1143, Positive conditional cache size: 21, Positive unconditional cache size: 1122, Negative cache size: 64, Negative conditional cache size: 6, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478364 ], Independence queries for same thread: 4005, Persistent sets #1 benchmarks: Persistent set computation time: 90.3s, Number of persistent set computation: 5585, Number of trivial persistent sets: 3772, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1176, independent: 1122, independent conditional: 0, independent unconditional: 1122, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 353947, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 24140, dependent conditional: 24085, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 349942, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 20135, dependent conditional: 20081, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 162640, dependent conditional: 162532, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1207, independent: 1143, independent conditional: 21, independent unconditional: 1122, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93582, independent: 711, independent conditional: 383, independent unconditional: 328, dependent: 92871, dependent conditional: 117, dependent unconditional: 92754, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 492447, independent: 328664, independent conditional: 12497, independent unconditional: 316167, dependent: 162576, dependent conditional: 329, dependent unconditional: 162247, unknown: 1207, unknown conditional: 27, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1143, Positive conditional cache size: 21, Positive unconditional cache size: 1122, Negative cache size: 64, Negative conditional cache size: 6, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478364, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 328685, independent unconditional: 1122, dependent: 162640, dependent conditional: 162532, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 492447, independent: 329807, independent conditional: 12518, independent unconditional: 317289, dependent: 162640, dependent conditional: 335, dependent unconditional: 162305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1207, independent: 1143, independent conditional: 21, independent unconditional: 1122, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 36, independent conditional: 21, independent unconditional: 15, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93582, independent: 711, independent conditional: 383, independent unconditional: 328, dependent: 92871, dependent conditional: 117, dependent unconditional: 92754, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 492447, independent: 328664, independent conditional: 12497, independent unconditional: 316167, dependent: 162576, dependent conditional: 329, dependent unconditional: 162247, unknown: 1207, unknown conditional: 27, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1143, Positive conditional cache size: 21, Positive unconditional cache size: 1122, Negative cache size: 64, Negative conditional cache size: 6, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478364 ], Independence queries for same thread: 4005
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p3_EAX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool a$flush_delayed;
[L722] 0 int a$mem_tmp;
[L723] 0 _Bool a$r_buff0_thd0;
[L724] 0 _Bool a$r_buff0_thd1;
[L725] 0 _Bool a$r_buff0_thd2;
[L726] 0 _Bool a$r_buff0_thd3;
[L727] 0 _Bool a$r_buff0_thd4;
[L728] 0 _Bool a$r_buff1_thd0;
[L729] 0 _Bool a$r_buff1_thd1;
[L730] 0 _Bool a$r_buff1_thd2;
[L731] 0 _Bool a$r_buff1_thd3;
[L732] 0 _Bool a$r_buff1_thd4;
[L733] 0 _Bool a$read_delayed;
[L734] 0 int *a$read_delayed_var;
[L735] 0 int a$w_buff0;
[L736] 0 _Bool a$w_buff0_used;
[L737] 0 int a$w_buff1;
[L738] 0 _Bool a$w_buff1_used;
[L739] 0 _Bool main$tmp_guard0;
[L740] 0 _Bool main$tmp_guard1;
[L742] 0 int x = 0;
[L744] 0 int y = 0;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L863] 0 pthread_t t1321;
[L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L865] 0 pthread_t t1322;
[L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L867] 0 pthread_t t1323;
[L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L869] 0 pthread_t t1324;
[L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L752] 1 a$w_buff1 = a$w_buff0
[L753] 1 a$w_buff0 = 1
[L754] 1 a$w_buff1_used = a$w_buff0_used
[L755] 1 a$w_buff0_used = (_Bool)1
[L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4
[L762] 1 a$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L765] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L782] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L785] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L797] 2 return 0;
[L802] 3 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L805] 3 __unbuffered_p2_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L817] 3 return 0;
[L822] 4 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L825] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L826] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L827] 4 a$flush_delayed = weak$$choice2
[L828] 4 a$mem_tmp = a
[L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L836] 4 __unbuffered_p3_EAX = a
[L837] 4 a = a$flush_delayed ? a$mem_tmp : a
[L838] 4 a$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L850] 4 return 0;
[L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L874] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L874] RET 0 assume_abort_if_not(main$tmp_guard0)
[L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L885] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
- UnprovableResult [Line: 868]: 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: 864]: 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: 866]: 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: 870]: 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 9 procedures, 81 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 102.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 98.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: 31, 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, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 0.6s, ConditionalCommutativityCheckTime: 0.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 6, ConditionalCommutativityTraceChecks: 3, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-18 04:14:20,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-10-18 04:14:20,911 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