./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 08:03:23,457 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 08:03:23,526 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 08:03:23,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 08:03:23,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 08:03:23,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 08:03:23,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 08:03:23,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 08:03:23,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 08:03:23,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 08:03:23,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 08:03:23,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 08:03:23,566 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 08:03:23,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 08:03:23,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 08:03:23,574 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 08:03:23,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 08:03:23,580 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 08:03:23,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 08:03:23,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 08:03:23,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 08:03:23,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 08:03:23,583 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 08:03:23,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 08:03:23,584 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 08:03:23,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 08:03:23,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 08:03:23,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 08:03:23,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:03:23,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 08:03:23,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 08:03:23,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 08:03:23,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 08:03:23,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 08:03:23,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 08:03:23,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 08:03:23,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 08:03:23,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 08:03:23,591 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 08:03:23,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu
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 -> Automizer
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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae
[2023-11-19 08:03:23,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 08:03:23,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 08:03:23,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 08:03:23,980 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 08:03:23,981 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 08:03:23,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i
[2023-11-19 08:03:27,137 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 08:03:27,484 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 08:03:27,485 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i
[2023-11-19 08:03:27,514 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/data/b718fedb9/95f5367f74714abc80d5a495cb3cc1db/FLAG558d657b7
[2023-11-19 08:03:27,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/data/b718fedb9/95f5367f74714abc80d5a495cb3cc1db
[2023-11-19 08:03:27,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 08:03:27,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 08:03:27,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 08:03:27,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 08:03:27,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 08:03:27,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:27" (1/1) ...
[2023-11-19 08:03:27,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a017eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:27, skipping insertion in model container
[2023-11-19 08:03:27,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:27" (1/1) ...
[2023-11-19 08:03:27,836 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 08:03:28,027 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027]
[2023-11-19 08:03:28,229 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:03:28,241 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 08:03:28,255 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027]
[2023-11-19 08:03:28,303 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:03:28,337 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:03:28,337 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:03:28,346 INFO L206 MainTranslator]: Completed translation
[2023-11-19 08:03:28,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28 WrapperNode
[2023-11-19 08:03:28,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 08:03:28,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 08:03:28,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 08:03:28,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 08:03:28,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,421 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120
[2023-11-19 08:03:28,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 08:03:28,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 08:03:28,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 08:03:28,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 08:03:28,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 08:03:28,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 08:03:28,505 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 08:03:28,505 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 08:03:28,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ...
[2023-11-19 08:03:28,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:03:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:28,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:28,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 08:03:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2023-11-19 08:03:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 08:03:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 08:03:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 08:03:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 08:03:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 08:03:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 08:03:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 08:03:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 08:03:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 08:03:28,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 08:03:28,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 08:03:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 08:03:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 08:03:28,595 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 08:03:28,814 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 08:03:28,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 08:03:29,269 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 08:03:29,615 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 08:03:29,615 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 08:03:29,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:29 BoogieIcfgContainer
[2023-11-19 08:03:29,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 08:03:29,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 08:03:29,628 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 08:03:29,632 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 08:03:29,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:27" (1/3) ...
[2023-11-19 08:03:29,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6818c73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:29, skipping insertion in model container
[2023-11-19 08:03:29,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (2/3) ...
[2023-11-19 08:03:29,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6818c73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:29, skipping insertion in model container
[2023-11-19 08:03:29,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:29" (3/3) ...
[2023-11-19 08:03:29,642 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i
[2023-11-19 08:03:29,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 08:03:29,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 08:03:29,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 08:03:29,668 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 08:03:29,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 08:03:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 222 flow
[2023-11-19 08:03:29,883 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events.
[2023-11-19 08:03:29,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:03:29,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place.
[2023-11-19 08:03:29,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 222 flow
[2023-11-19 08:03:29,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 92 transitions, 190 flow
[2023-11-19 08:03:29,900 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 08:03:29,922 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 92 transitions, 190 flow
[2023-11-19 08:03:29,927 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 92 transitions, 190 flow
[2023-11-19 08:03:29,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 92 transitions, 190 flow
[2023-11-19 08:03:29,971 INFO L124 PetriNetUnfolderBase]: 1/92 cut-off events.
[2023-11-19 08:03:29,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:03:29,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 1/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place.
[2023-11-19 08:03:29,974 INFO L119 LiptonReduction]: Number of co-enabled transitions 700
[2023-11-19 08:03:39,681 INFO L134 LiptonReduction]: Checked pairs total: 1462
[2023-11-19 08:03:39,682 INFO L136 LiptonReduction]: Total number of compositions: 81
[2023-11-19 08:03:39,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 08:03:39,729 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=PETRI_NET, 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;@2198fef9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 08:03:39,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2023-11-19 08:03:39,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 08:03:39,738 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events.
[2023-11-19 08:03:39,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:03:39,739 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:39,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:39,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:39,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash -137107204, now seen corresponding path program 1 times
[2023-11-19 08:03:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216260160]
[2023-11-19 08:03:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:39,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:40,510 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-19 08:03:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216260160]
[2023-11-19 08:03:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216260160] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 08:03:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414085783]
[2023-11-19 08:03:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:40,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 08:03:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 08:03:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 08:03:40,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 188
[2023-11-19 08:03:40,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-19 08:03:40,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:03:40,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 188
[2023-11-19 08:03:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:03:40,750 INFO L124 PetriNetUnfolderBase]: 73/139 cut-off events.
[2023-11-19 08:03:40,754 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-11-19 08:03:40,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 139 events. 73/139 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 449 event pairs, 17 based on Foata normal form. 3/141 useless extension candidates. Maximal degree in co-relation 278. Up to 114 conditions per place.
[2023-11-19 08:03:40,759 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions.
[2023-11-19 08:03:40,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 76 flow
[2023-11-19 08:03:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 08:03:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 08:03:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions.
[2023-11-19 08:03:40,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915
[2023-11-19 08:03:40,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions.
[2023-11-19 08:03:40,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions.
[2023-11-19 08:03:40,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:40,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions.
[2023-11-19 08:03:40,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 08:03:40,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-19 08:03:40,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-19 08:03:40,809 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 34 flow. Second operand 3 states and 303 transitions.
[2023-11-19 08:03:40,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 76 flow
[2023-11-19 08:03:40,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 08:03:40,815 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 40 flow
[2023-11-19 08:03:40,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=14}
[2023-11-19 08:03:40,822 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places.
[2023-11-19 08:03:40,822 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow
[2023-11-19 08:03:40,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-19 08:03:40,823 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:40,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:40,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 08:03:40,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:40,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 44643155, now seen corresponding path program 1 times
[2023-11-19 08:03:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871278414]
[2023-11-19 08:03:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:41,085 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-19 08:03:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871278414]
[2023-11-19 08:03:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871278414] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:41,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 08:03:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913160892]
[2023-11-19 08:03:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:41,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 08:03:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 08:03:41,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 08:03:41,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 188
[2023-11-19 08:03:41,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-19 08:03:41,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:03:41,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 188
[2023-11-19 08:03:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:03:41,259 INFO L124 PetriNetUnfolderBase]: 112/213 cut-off events.
[2023-11-19 08:03:41,260 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2023-11-19 08:03:41,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 213 events. 112/213 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 761 event pairs, 38 based on Foata normal form. 16/229 useless extension candidates. Maximal degree in co-relation 462. Up to 76 conditions per place.
[2023-11-19 08:03:41,264 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 18 selfloop transitions, 3 changer transitions 7/28 dead transitions.
[2023-11-19 08:03:41,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 129 flow
[2023-11-19 08:03:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 08:03:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 08:03:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions.
[2023-11-19 08:03:41,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345744680851063
[2023-11-19 08:03:41,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions.
[2023-11-19 08:03:41,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions.
[2023-11-19 08:03:41,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:41,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions.
[2023-11-19 08:03:41,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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-19 08:03:41,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:41,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:41,283 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 4 states and 402 transitions.
[2023-11-19 08:03:41,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 129 flow
[2023-11-19 08:03:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 08:03:41,286 INFO L231 Difference]: Finished difference. Result has 25 places, 14 transitions, 50 flow
[2023-11-19 08:03:41,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=14}
[2023-11-19 08:03:41,288 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places.
[2023-11-19 08:03:41,288 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow
[2023-11-19 08:03:41,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-19 08:03:41,295 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:41,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 08:03:41,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:41,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1451802553, now seen corresponding path program 1 times
[2023-11-19 08:03:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444368899]
[2023-11-19 08:03:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:43,314 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-19 08:03:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444368899]
[2023-11-19 08:03:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444368899] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:43,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:43,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:03:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137738226]
[2023-11-19 08:03:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:43,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 08:03:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 08:03:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-19 08:03:43,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 188
[2023-11-19 08:03:43,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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-19 08:03:43,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:03:43,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 188
[2023-11-19 08:03:43,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:03:43,627 INFO L124 PetriNetUnfolderBase]: 43/94 cut-off events.
[2023-11-19 08:03:43,627 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES.
[2023-11-19 08:03:43,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 94 events. 43/94 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 235 event pairs, 7 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 231. Up to 53 conditions per place.
[2023-11-19 08:03:43,630 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions.
[2023-11-19 08:03:43,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 106 flow
[2023-11-19 08:03:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 08:03:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 08:03:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions.
[2023-11-19 08:03:43,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49601063829787234
[2023-11-19 08:03:43,633 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions.
[2023-11-19 08:03:43,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions.
[2023-11-19 08:03:43,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:43,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions.
[2023-11-19 08:03:43,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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-19 08:03:43,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:43,639 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:43,639 INFO L175 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 4 states and 373 transitions.
[2023-11-19 08:03:43,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 106 flow
[2023-11-19 08:03:43,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 94 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 08:03:43,642 INFO L231 Difference]: Finished difference. Result has 25 places, 14 transitions, 48 flow
[2023-11-19 08:03:43,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=25, PETRI_TRANSITIONS=14}
[2023-11-19 08:03:43,643 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places.
[2023-11-19 08:03:43,644 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 48 flow
[2023-11-19 08:03:43,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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-19 08:03:43,645 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:43,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 08:03:43,646 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:43,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1480554772, now seen corresponding path program 1 times
[2023-11-19 08:03:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903818083]
[2023-11-19 08:03:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:43,944 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-19 08:03:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903818083]
[2023-11-19 08:03:43,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903818083] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:43,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:43,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 08:03:43,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854250689]
[2023-11-19 08:03:43,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:43,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 08:03:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:43,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 08:03:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 08:03:43,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 188
[2023-11-19 08:03:43,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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-19 08:03:43,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:03:43,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 188
[2023-11-19 08:03:43,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:03:44,051 INFO L124 PetriNetUnfolderBase]: 29/76 cut-off events.
[2023-11-19 08:03:44,051 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES.
[2023-11-19 08:03:44,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 76 events. 29/76 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 207 event pairs, 6 based on Foata normal form. 11/86 useless extension candidates. Maximal degree in co-relation 184. Up to 30 conditions per place.
[2023-11-19 08:03:44,053 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 21 selfloop transitions, 4 changer transitions 1/27 dead transitions.
[2023-11-19 08:03:44,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 138 flow
[2023-11-19 08:03:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 08:03:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 08:03:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions.
[2023-11-19 08:03:44,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526595744680851
[2023-11-19 08:03:44,056 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions.
[2023-11-19 08:03:44,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions.
[2023-11-19 08:03:44,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:44,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions.
[2023-11-19 08:03:44,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-19 08:03:44,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:44,061 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-19 08:03:44,061 INFO L175 Difference]: Start difference. First operand has 25 places, 14 transitions, 48 flow. Second operand 4 states and 396 transitions.
[2023-11-19 08:03:44,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 138 flow
[2023-11-19 08:03:44,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 08:03:44,063 INFO L231 Difference]: Finished difference. Result has 27 places, 16 transitions, 68 flow
[2023-11-19 08:03:44,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=16}
[2023-11-19 08:03:44,065 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places.
[2023-11-19 08:03:44,065 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 16 transitions, 68 flow
[2023-11-19 08:03:44,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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-19 08:03:44,066 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:44,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 08:03:44,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:44,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1985388839, now seen corresponding path program 1 times
[2023-11-19 08:03:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:44,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21083609]
[2023-11-19 08:03:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:44,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:44,308 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-19 08:03:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21083609]
[2023-11-19 08:03:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21083609] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:03:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127634593]
[2023-11-19 08:03:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 08:03:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 08:03:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 08:03:44,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 188
[2023-11-19 08:03:44,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 16 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 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-19 08:03:44,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:03:44,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 188
[2023-11-19 08:03:44,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:03:44,414 INFO L124 PetriNetUnfolderBase]: 12/40 cut-off events.
[2023-11-19 08:03:44,414 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES.
[2023-11-19 08:03:44,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 40 events. 12/40 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 2 based on Foata normal form. 6/45 useless extension candidates. Maximal degree in co-relation 122. Up to 20 conditions per place.
[2023-11-19 08:03:44,419 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 14 selfloop transitions, 6 changer transitions 1/22 dead transitions.
[2023-11-19 08:03:44,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 130 flow
[2023-11-19 08:03:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 08:03:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 08:03:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions.
[2023-11-19 08:03:44,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138297872340426
[2023-11-19 08:03:44,422 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions.
[2023-11-19 08:03:44,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions.
[2023-11-19 08:03:44,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:44,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions.
[2023-11-19 08:03:44,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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-19 08:03:44,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 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-19 08:03:44,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 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-19 08:03:44,430 INFO L175 Difference]: Start difference. First operand has 27 places, 16 transitions, 68 flow. Second operand 5 states and 483 transitions.
[2023-11-19 08:03:44,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 130 flow
[2023-11-19 08:03:44,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 111 flow, removed 3 selfloop flow, removed 4 redundant places.
[2023-11-19 08:03:44,433 INFO L231 Difference]: Finished difference. Result has 29 places, 16 transitions, 76 flow
[2023-11-19 08:03:44,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=29, PETRI_TRANSITIONS=16}
[2023-11-19 08:03:44,436 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places.
[2023-11-19 08:03:44,437 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 16 transitions, 76 flow
[2023-11-19 08:03:44,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 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-19 08:03:44,437 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:03:44,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:44,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 08:03:44,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-19 08:03:44,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1084084659, now seen corresponding path program 1 times
[2023-11-19 08:03:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932142429]
[2023-11-19 08:03:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:44,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:44,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:44,729 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 08:03:44,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2023-11-19 08:03:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2023-11-19 08:03:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2023-11-19 08:03:44,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 08:03:44,733 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:44,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 08:03:44,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 08:03:44,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated
[2023-11-19 08:03:44,805 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated
[2023-11-19 08:03:44,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:03:44 BasicIcfg
[2023-11-19 08:03:44,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 08:03:44,835 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 08:03:44,835 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 08:03:44,835 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 08:03:44,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:29" (3/4) ...
[2023-11-19 08:03:44,842 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 08:03:44,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated
[2023-11-19 08:03:44,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated
[2023-11-19 08:03:44,973 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 08:03:44,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 08:03:44,974 INFO L158 Benchmark]: Toolchain (without parser) took 17231.10ms. Allocated memory was 130.0MB in the beginning and 257.9MB in the end (delta: 127.9MB). Free memory was 86.1MB in the beginning and 193.9MB in the end (delta: -107.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,975 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 130.0MB. Free memory was 100.8MB in the beginning and 100.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 08:03:44,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.99ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 62.7MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.37ms. Allocated memory is still 130.0MB. Free memory was 62.7MB in the beginning and 60.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,976 INFO L158 Benchmark]: Boogie Preprocessor took 80.64ms. Allocated memory is still 130.0MB. Free memory was 60.3MB in the beginning and 58.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,976 INFO L158 Benchmark]: RCFGBuilder took 1118.41ms. Allocated memory is still 130.0MB. Free memory was 58.2MB in the beginning and 90.3MB in the end (delta: -32.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,977 INFO L158 Benchmark]: TraceAbstraction took 15206.39ms. Allocated memory was 130.0MB in the beginning and 257.9MB in the end (delta: 127.9MB). Free memory was 89.5MB in the beginning and 203.4MB in the end (delta: -113.8MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,977 INFO L158 Benchmark]: Witness Printer took 138.77ms. Allocated memory is still 257.9MB. Free memory was 203.4MB in the beginning and 193.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2023-11-19 08:03:44,980 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.37ms. Allocated memory is still 130.0MB. Free memory was 100.8MB in the beginning and 100.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 601.99ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 62.7MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 75.37ms. Allocated memory is still 130.0MB. Free memory was 62.7MB in the beginning and 60.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 80.64ms. Allocated memory is still 130.0MB. Free memory was 60.3MB in the beginning and 58.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1118.41ms. Allocated memory is still 130.0MB. Free memory was 58.2MB in the beginning and 90.3MB in the end (delta: -32.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 15206.39ms. Allocated memory was 130.0MB in the beginning and 257.9MB in the end (delta: 127.9MB). Free memory was 89.5MB in the beginning and 203.4MB in the end (delta: -113.8MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB.
* Witness Printer took 138.77ms. Allocated memory is still 257.9MB. Free memory was 203.4MB in the beginning and 193.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre24 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: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 9.8s, 98 PlacesBefore, 21 PlacesAfterwards, 92 TransitionsBefore, 14 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 1462 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 804, independent: 696, independent conditional: 0, independent unconditional: 696, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 373, independent: 350, independent conditional: 0, independent unconditional: 350, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 804, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 373, unknown conditional: 0, unknown unconditional: 373] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L713] 0 int __unbuffered_p0_EAX$mem_tmp;
[L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L720] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L721] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L722] 0 int __unbuffered_p0_EAX$w_buff0;
[L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L724] 0 int __unbuffered_p0_EAX$w_buff1;
[L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L727] 0 int __unbuffered_p1_EAX = 0;
[L728] 0 _Bool main$tmp_guard0;
[L729] 0 _Bool main$tmp_guard1;
[L731] 0 int x = 0;
[L733] 0 int y = 0;
[L734] 0 _Bool y$flush_delayed;
[L735] 0 int y$mem_tmp;
[L736] 0 _Bool y$r_buff0_thd0;
[L737] 0 _Bool y$r_buff0_thd1;
[L738] 0 _Bool y$r_buff0_thd2;
[L739] 0 _Bool y$r_buff1_thd0;
[L740] 0 _Bool y$r_buff1_thd1;
[L741] 0 _Bool y$r_buff1_thd2;
[L742] 0 _Bool y$read_delayed;
[L743] 0 int *y$read_delayed_var;
[L744] 0 int y$w_buff0;
[L745] 0 _Bool y$w_buff0_used;
[L746] 0 int y$w_buff1;
[L747] 0 _Bool y$w_buff1_used;
[L748] 0 _Bool weak$$choice0;
[L749] 0 _Bool weak$$choice1;
[L750] 0 _Bool weak$$choice2;
[L813] 0 pthread_t t1921;
[L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L754] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L755] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L756] 1 y$flush_delayed = weak$$choice2
[L757] EXPR 1 \read(y)
[L757] 1 y$mem_tmp = y
[L758] 1 weak$$choice1 = __VERIFIER_nondet_bool()
[L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L759] EXPR 1 \read(y)
[L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))))
[L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))))
[L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))))
[L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y
[L768] EXPR 1 \read(y)
[L768] 1 __unbuffered_p0_EAX = y
[L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L769] EXPR 1 \read(y)
[L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L769] 1 y = y$flush_delayed ? y$mem_tmp : y
[L770] 1 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L773] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L815] 0 pthread_t t1922;
[L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={5:0}, t1922={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L785] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L788] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L791] EXPR 2 \read(y)
[L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L780] 1 return 0;
[L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L800] 2 return 0;
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={5:0}, t1922={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L820] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L820] RET 0 assume_abort_if_not(main$tmp_guard0)
[L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L822] EXPR 0 \read(y)
[L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={5:0}, t1922={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L829] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1)
[L833] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
- UnprovableResult [Line: 814]: 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: 816]: 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 with 1 thread instances
CFG has 5 procedures, 124 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 45 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 20, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-19 08:03:45,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbdc26c-33df-45d7-8203-3e61b475e1cf/bin/uautomizer-verify-uCwYo4JHxu/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