./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d2ba6107
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/mix010.opt.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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --preprocessor.use.memory.slicer true
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-d2ba610-m
[2023-11-21 17:45:25,294 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-21 17:45:25,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2023-11-21 17:45:25,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-21 17:45:25,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-21 17:45:25,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-21 17:45:25,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-21 17:45:25,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-21 17:45:25,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-21 17:45:25,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-21 17:45:25,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-21 17:45:25,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-21 17:45:25,403 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-21 17:45:25,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-21 17:45:25,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-21 17:45:25,405 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-21 17:45:25,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-21 17:45:25,416 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-21 17:45:25,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-21 17:45:25,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-21 17:45:25,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-21 17:45:25,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-21 17:45:25,417 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-21 17:45:25,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-21 17:45:25,418 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-21 17:45:25,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-21 17:45:25,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-21 17:45:25,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-21 17:45:25,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-21 17:45:25,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-21 17:45:25,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-21 17:45:25,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-21 17:45:25,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-21 17:45:25,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-21 17:45:25,421 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2023-11-21 17:45:25,422 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2023-11-21 17:45:25,422 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true
[2023-11-21 17:45:25,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-21 17:45:25,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-21 17:45:25,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-21 17:45:25,650 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-21 17:45:25,651 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-21 17:45:25,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-11-21 17:45:26,606 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-21 17:45:26,772 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-21 17:45:26,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-11-21 17:45:26,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/834673873/64b9835797d342d994fc4d284ee46c85/FLAGcd84ed95c
[2023-11-21 17:45:26,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/834673873/64b9835797d342d994fc4d284ee46c85
[2023-11-21 17:45:26,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-21 17:45:26,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-21 17:45:26,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-21 17:45:26,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-21 17:45:26,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-21 17:45:26,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:45:26" (1/1) ...
[2023-11-21 17:45:26,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9d37fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:26, skipping insertion in model container
[2023-11-21 17:45:26,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:45:26" (1/1) ...
[2023-11-21 17:45:26,849 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-21 17:45:26,971 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-11-21 17:45:27,118 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-21 17:45:27,133 INFO L202 MainTranslator]: Completed pre-run
[2023-11-21 17:45:27,143 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-11-21 17:45:27,203 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-21 17:45:27,230 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-21 17:45:27,231 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-21 17:45:27,237 INFO L206 MainTranslator]: Completed translation
[2023-11-21 17:45:27,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27 WrapperNode
[2023-11-21 17:45:27,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-21 17:45:27,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-21 17:45:27,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-21 17:45:27,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-21 17:45:27,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,306 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151
[2023-11-21 17:45:27,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-21 17:45:27,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-21 17:45:27,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-21 17:45:27,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-21 17:45:27,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,328 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,351 INFO L193 HeapSplitter]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]
[2023-11-21 17:45:27,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-21 17:45:27,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-21 17:45:27,381 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-21 17:45:27,382 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-21 17:45:27,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (1/1) ...
[2023-11-21 17:45:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-21 17:45:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2023-11-21 17:45:27,456 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)
[2023-11-21 17:45:27,466 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
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-21 17:45:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-21 17:45:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-21 17:45:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-21 17:45:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-21 17:45:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-21 17:45:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-21 17:45:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-21 17:45:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-21 17:45:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-21 17:45:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-21 17:45:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2023-11-21 17:45:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2023-11-21 17:45:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2023-11-21 17:45:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-21 17:45:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-21 17:45:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-21 17:45:27,508 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-21 17:45:27,640 INFO L240 CfgBuilder]: Building ICFG
[2023-11-21 17:45:27,641 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-21 17:45:27,884 INFO L281 CfgBuilder]: Performing block encoding
[2023-11-21 17:45:28,039 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-21 17:45:28,042 INFO L308 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-21 17:45:28,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:45:28 BoogieIcfgContainer
[2023-11-21 17:45:28,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-21 17:45:28,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-21 17:45:28,046 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-21 17:45:28,048 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-21 17:45:28,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:45:26" (1/3) ...
[2023-11-21 17:45:28,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105df7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:45:28, skipping insertion in model container
[2023-11-21 17:45:28,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:45:27" (2/3) ...
[2023-11-21 17:45:28,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105df7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:45:28, skipping insertion in model container
[2023-11-21 17:45:28,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:45:28" (3/3) ...
[2023-11-21 17:45:28,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i
[2023-11-21 17:45:28,057 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-21 17:45:28,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-21 17:45:28,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-21 17:45:28,063 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-21 17:45:28,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-21 17:45:28,145 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-21 17:45:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2023-11-21 17:45:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2023-11-21 17:45:28,147 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)
[2023-11-21 17:45:28,148 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
[2023-11-21 17:45:28,198 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2023-11-21 17:45:28,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork2 ========
[2023-11-21 17:45:28,217 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@50944ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-21 17:45:28,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-21 17:45:28,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-21 17:45:28,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1041132037, now seen corresponding path program 1 times
[2023-11-21 17:45:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497984839]
[2023-11-21 17:45:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-21 17:45:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-21 17:45:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-21 17:45:28,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497984839]
[2023-11-21 17:45:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497984839] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-21 17:45:28,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-21 17:45:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-21 17:45:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028965420]
[2023-11-21 17:45:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-21 17:45:28,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-21 17:45:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-21 17:45:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-21 17:45:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-21 17:45:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:29,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-11-21 17:45:29,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-21 17:45:29,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:29,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-21 17:45:29,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-21 17:45:29,421 INFO L445 BasicCegarLoop]: Path program histogram: [1]
[2023-11-21 17:45:29,422 INFO L307 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (1/2)
[2023-11-21 17:45:29,425 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-21 17:45:29,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2023-11-21 17:45:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2023-11-21 17:45:29,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2023-11-21 17:45:29,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process
[2023-11-21 17:45:29,458 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2023-11-21 17:45:29,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2023-11-21 17:45:29,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@50944ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-21 17:45:29,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2023-11-21 17:45:29,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2023-11-21 17:45:29,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2045520008, now seen corresponding path program 1 times
[2023-11-21 17:45:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955831289]
[2023-11-21 17:45:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-21 17:45:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-21 17:45:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-21 17:45:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955831289]
[2023-11-21 17:45:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955831289] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-21 17:45:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-21 17:45:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-21 17:45:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120117501]
[2023-11-21 17:45:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-21 17:45:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-21 17:45:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-21 17:45:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-21 17:45:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-21 17:45:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:29,817 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-11-21 17:45:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-21 17:45:29,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:29,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-21 17:45:29,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2023-11-21 17:45:29,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash 431483524, now seen corresponding path program 1 times
[2023-11-21 17:45:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:29,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213324605]
[2023-11-21 17:45:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:29,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-21 17:45:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-21 17:45:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-21 17:45:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213324605]
[2023-11-21 17:45:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213324605] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-21 17:45:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-21 17:45:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-21 17:45:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844156421]
[2023-11-21 17:45:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-21 17:45:30,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-21 17:45:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-21 17:45:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-21 17:45:30,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-21 17:45:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:30,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-11-21 17:45:30,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-21 17:45:30,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:30,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-21 17:45:30,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-21 17:45:30,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2023-11-21 17:45:30,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1699774744, now seen corresponding path program 1 times
[2023-11-21 17:45:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624493110]
[2023-11-21 17:45:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-21 17:45:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-21 17:45:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-21 17:45:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624493110]
[2023-11-21 17:45:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624493110] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-21 17:45:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-21 17:45:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-21 17:45:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236110120]
[2023-11-21 17:45:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-21 17:45:30,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-21 17:45:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-21 17:45:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-21 17:45:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-21 17:45:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:30,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-11-21 17:45:30,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) 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)
[2023-11-21 17:45:30,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:30,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2023-11-21 17:45:30,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-21 17:45:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-21 17:45:30,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-21 17:45:30,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2023-11-21 17:45:30,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1941138976, now seen corresponding path program 2 times
[2023-11-21 17:45:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698243789]
[2023-11-21 17:45:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-21 17:45:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-21 17:45:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-21 17:45:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698243789]
[2023-11-21 17:45:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698243789] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-21 17:45:31,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-21 17:45:31,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-21 17:45:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522289888]
[2023-11-21 17:45:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-21 17:45:31,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-21 17:45:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-21 17:45:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-21 17:45:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2023-11-21 17:45:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:31,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-11-21 17:45:31,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 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)
[2023-11-21 17:45:31,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:31,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2023-11-21 17:45:31,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2023-11-21 17:45:31,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2023-11-21 17:45:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-21 17:45:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-21 17:45:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-21 17:45:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2023-11-21 17:45:31,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-21 17:45:31,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2023-11-21 17:45:31,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-21 17:45:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1111896050, now seen corresponding path program 3 times
[2023-11-21 17:45:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-21 17:45:31,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872435848]
[2023-11-21 17:45:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-21 17:45:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-21 17:45:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-21 17:45:31,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-21 17:45:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-21 17:45:31,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-21 17:45:31,926 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-21 17:45:31,926 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2023-11-21 17:45:31,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2023-11-21 17:45:31,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2023-11-21 17:45:31,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2023-11-21 17:45:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-21 17:45:31,932 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1]
[2023-11-21 17:45:31,932 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2)
[2023-11-21 17:45:31,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-21 17:45:31,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-21 17:45:31,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-21 17:45:31,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-21 17:45:31,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-21 17:45:32,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:45:32 BasicIcfg
[2023-11-21 17:45:32,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-21 17:45:32,010 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-21 17:45:32,011 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-21 17:45:32,011 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-21 17:45:32,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:45:28" (3/4) ...
[2023-11-21 17:45:32,011 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-21 17:45:32,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-21 17:45:32,032 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-21 17:45:32,032 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-21 17:45:32,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2023-11-21 17:45:32,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-21 17:45:32,089 INFO L158 Benchmark]: Toolchain (without parser) took 5291.18ms. Allocated memory was 130.0MB in the beginning and 325.1MB in the end (delta: 195.0MB). Free memory was 59.9MB in the beginning and 137.8MB in the end (delta: -77.8MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,089 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-21 17:45:32,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.62ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 59.8MB in the beginning and 154.8MB in the end (delta: -95.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.42ms. Allocated memory is still 199.2MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,089 INFO L158 Benchmark]: Boogie Preprocessor took 73.65ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 148.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,090 INFO L158 Benchmark]: RCFGBuilder took 663.01ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 96.1MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,090 INFO L158 Benchmark]: TraceAbstraction took 3964.33ms. Allocated memory was 199.2MB in the beginning and 325.1MB in the end (delta: 125.8MB). Free memory was 96.1MB in the beginning and 153.5MB in the end (delta: -57.4MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,090 INFO L158 Benchmark]: Witness Printer took 77.93ms. Allocated memory is still 325.1MB. Free memory was 152.4MB in the beginning and 137.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2023-11-21 17:45:32,091 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.13ms. Allocated memory is still 130.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 436.62ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 59.8MB in the beginning and 154.8MB in the end (delta: -95.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 68.42ms. Allocated memory is still 199.2MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 73.65ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 148.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 663.01ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 96.1MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 3964.33ms. Allocated memory was 199.2MB in the beginning and 325.1MB in the end (delta: 125.8MB). Free memory was 96.1MB in the beginning and 153.5MB in the end (delta: -57.4MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB.
* Witness Printer took 77.93ms. Allocated memory is still 325.1MB. Free memory was 152.4MB in the beginning and 137.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation #1 benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3601, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 120, dependent conditional: 97, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3597, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 116, dependent conditional: 93, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3597, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 116, dependent conditional: 93, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 93, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 37, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 37, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 848, independent: 819, independent conditional: 4, independent unconditional: 815, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 848, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 72, independent conditional: 31, independent unconditional: 41, dependent: 192, dependent conditional: 52, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3744, independent: 2662, independent conditional: 50, independent unconditional: 2612, dependent: 234, dependent conditional: 33, dependent unconditional: 201, unknown: 848, unknown conditional: 8, unknown unconditional: 840] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 819, Positive conditional cache size: 4, Positive unconditional cache size: 815, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 1, Independence queries for same thread: 4
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.3s, Number of persistent set computation: 467, Number of trivial persistent sets: 143, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 838, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3601, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 120, dependent conditional: 97, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3597, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 116, dependent conditional: 93, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3597, independent: 3481, independent conditional: 2666, independent unconditional: 815, dependent: 116, dependent conditional: 93, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 93, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 37, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3744, independent: 3481, independent conditional: 54, independent unconditional: 3427, dependent: 263, dependent conditional: 37, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 848, independent: 819, independent conditional: 4, independent unconditional: 815, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 848, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 72, independent conditional: 31, independent unconditional: 41, dependent: 192, dependent conditional: 52, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3744, independent: 2662, independent conditional: 50, independent unconditional: 2612, dependent: 234, dependent conditional: 33, dependent unconditional: 201, unknown: 848, unknown conditional: 8, unknown unconditional: 840] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 819, Positive conditional cache size: 4, Positive unconditional cache size: 815, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 1, Independence queries for same thread: 4
- StatisticsResult: Independence relation #1 benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6842, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 131, dependent conditional: 105, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6823, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 112, dependent conditional: 86, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6823, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 112, dependent conditional: 86, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 529, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 26, dependent unconditional: 818, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 26, dependent unconditional: 818, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 798, independent: 767, independent conditional: 14, independent unconditional: 753, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 798, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 64, independent conditional: 39, independent unconditional: 25, dependent: 192, dependent conditional: 50, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7555, independent: 5944, independent conditional: 189, independent unconditional: 5755, dependent: 813, dependent conditional: 22, dependent unconditional: 791, unknown: 798, unknown conditional: 18, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 767, Positive conditional cache size: 14, Positive unconditional cache size: 753, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 503, Maximal queried relation: 3, Independence queries for same thread: 19
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.2s, Number of persistent set computation: 691, Number of trivial persistent sets: 360, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 779, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6842, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 131, dependent conditional: 105, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6823, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 112, dependent conditional: 86, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6823, independent: 6711, independent conditional: 5958, independent unconditional: 753, dependent: 112, dependent conditional: 86, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 529, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 26, dependent unconditional: 818, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7555, independent: 6711, independent conditional: 203, independent unconditional: 6508, dependent: 844, dependent conditional: 26, dependent unconditional: 818, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 798, independent: 767, independent conditional: 14, independent unconditional: 753, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 798, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 64, independent conditional: 39, independent unconditional: 25, dependent: 192, dependent conditional: 50, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7555, independent: 5944, independent conditional: 189, independent unconditional: 5755, dependent: 813, dependent conditional: 22, dependent unconditional: 791, unknown: 798, unknown conditional: 18, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 767, Positive conditional cache size: 14, Positive unconditional cache size: 753, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 503, Maximal queried relation: 3, Independence queries for same thread: 19
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L717] 0 int __unbuffered_p2_EAX = 0;
[L719] 0 int __unbuffered_p2_EBX = 0;
[L721] 0 int a = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L729] 0 int z = 0;
[L730] 0 _Bool z$flush_delayed;
[L731] 0 int z$mem_tmp;
[L732] 0 _Bool z$r_buff0_thd0;
[L733] 0 _Bool z$r_buff0_thd1;
[L734] 0 _Bool z$r_buff0_thd2;
[L735] 0 _Bool z$r_buff0_thd3;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$read_delayed;
[L741] 0 int *z$read_delayed_var;
[L742] 0 int z$w_buff0;
[L743] 0 _Bool z$w_buff0_used;
[L744] 0 int z$w_buff1;
[L745] 0 _Bool z$w_buff1_used;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L853] 0 pthread_t t260;
[L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L855] 0 pthread_t t261;
[L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L857] 0 pthread_t t262;
[L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800] 3 z$w_buff1 = z$w_buff0
[L801] 3 z$w_buff0 = 1
[L802] 3 z$w_buff1_used = z$w_buff0_used
[L803] 3 z$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L809] 3 z$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 z$flush_delayed = weak$$choice2
[L815] 3 z$mem_tmp = z
[L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = z
[L824] 3 z = z$flush_delayed ? z$mem_tmp : z
[L825] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828] 3 __unbuffered_p2_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L766] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 z$flush_delayed = weak$$choice2
[L778] 2 z$mem_tmp = z
[L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = z
[L787] 2 z = z$flush_delayed ? z$mem_tmp : z
[L788] 2 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L795] 2 return 0;
[L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L840] 3 return 0;
[L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L862] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L862] RET 0 assume_abort_if_not(main$tmp_guard0)
[L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L873] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- UnprovableResult [Line: 856]: 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: 854]: 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: 858]: 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: P2Thread1of1ForFork2 with 1 thread instances
CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, 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: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.8s, 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: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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
RESULT: Ultimate proved your program to be incorrect!
[2023-11-21 17:45:32,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0
[2023-11-21 17:45:32,323 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
[2023-11-21 17:45:32,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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