./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
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_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:32:28,615 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:32:28,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:32:28,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:32:28,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:32:28,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:32:28,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:32:28,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:32:28,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:32:28,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:32:28,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:32:28,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:32:28,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:32:28,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:32:28,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:32:28,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:32:28,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:32:28,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:32:28,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:32:28,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:32:28,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:32:28,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:32:28,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:32:28,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:32:28,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:32:28,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:32:28,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:32:28,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:32:28,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:32:28,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:32:28,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:32:28,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:32:28,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:32:28,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:32:28,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:32:28,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:32:28,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:32:28,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:32:28,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:32:28,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:32:28,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:32:28,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 20:32:28,729 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:32:28,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:32:28,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:32:28,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:32:28,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:32:28,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:32:28,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:32:28,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:32:28,733 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:32:28,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:32:28,734 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:32:28,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:32:28,734 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:32:28,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:32:28,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:32:28,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:32:28,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:32:28,735 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:32:28,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:32:28,736 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:32:28,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:32:28,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:32:28,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:32:28,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:32:28,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:32:28,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:32:28,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:32:28,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:32:28,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:32:28,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:32:28,739 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:32:28,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:32:28,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:32:28,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/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_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1
[2022-11-02 20:32:29,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:32:29,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:32:29,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:32:29,070 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:32:29,071 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:32:29,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i
[2022-11-02 20:32:29,173 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/data/88e68203c/9ef22224692848ff8db835495ad88f59/FLAGcb742e44d
[2022-11-02 20:32:29,873 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:32:29,874 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i
[2022-11-02 20:32:29,901 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/data/88e68203c/9ef22224692848ff8db835495ad88f59/FLAGcb742e44d
[2022-11-02 20:32:30,063 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/data/88e68203c/9ef22224692848ff8db835495ad88f59
[2022-11-02 20:32:30,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:32:30,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:32:30,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:32:30,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:32:30,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:32:30,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8909df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30, skipping insertion in model container
[2022-11-02 20:32:30,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:32:30,186 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:32:30,480 WARN L230 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_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992]
[2022-11-02 20:32:30,716 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:32:30,726 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:32:30,742 WARN L230 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_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992]
[2022-11-02 20:32:30,798 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:32:30,845 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:32:30,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30 WrapperNode
[2022-11-02 20:32:30,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:32:30,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:32:30,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:32:30,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:32:30,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,906 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176
[2022-11-02 20:32:30,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:32:30,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:32:30,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:32:30,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:32:30,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:32:30,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:32:30,953 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:32:30,953 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:32:30,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (1/1) ...
[2022-11-02 20:32:30,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:32:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:32:30,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:32:31,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:32:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 20:32:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-02 20:32:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:32:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-02 20:32:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-02 20:32:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-11-02 20:32:31,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-11-02 20:32:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-11-02 20:32:31,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-11-02 20:32:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-11-02 20:32:31,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-11-02 20:32:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:32:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-02 20:32:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:32:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:32:31,063 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-11-02 20:32:31,269 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:32:31,272 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:32:32,038 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:32:32,507 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:32:32,507 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-02 20:32:32,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:32 BoogieIcfgContainer
[2022-11-02 20:32:32,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:32:32,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:32:32,515 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:32:32,521 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:32:32,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:32:30" (1/3) ...
[2022-11-02 20:32:32,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682bf883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:32, skipping insertion in model container
[2022-11-02 20:32:32,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:30" (2/3) ...
[2022-11-02 20:32:32,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682bf883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:32, skipping insertion in model container
[2022-11-02 20:32:32,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:32" (3/3) ...
[2022-11-02 20:32:32,525 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i
[2022-11-02 20:32:32,536 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-11-02 20:32:32,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:32:32,549 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-11-02 20:32:32,549 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-02 20:32:32,675 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-11-02 20:32:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow
[2022-11-02 20:32:32,834 INFO L130 PetriNetUnfolder]: 2/112 cut-off events.
[2022-11-02 20:32:32,835 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:32:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place.
[2022-11-02 20:32:32,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow
[2022-11-02 20:32:32,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow
[2022-11-02 20:32:32,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:32:32,874 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26b80634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:32:32,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2022-11-02 20:32:32,887 INFO L130 PetriNetUnfolder]: 0/46 cut-off events.
[2022-11-02 20:32:32,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:32:32,887 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:32,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:32,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1923181394, now seen corresponding path program 1 times
[2022-11-02 20:32:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:32,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131513125]
[2022-11-02 20:32:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131513125]
[2022-11-02 20:32:33,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131513125] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:33,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:33,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:32:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260373584]
[2022-11-02 20:32:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:33,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:32:33,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:32:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:32:33,720 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115
[2022-11-02 20:32:33,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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)
[2022-11-02 20:32:33,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:33,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115
[2022-11-02 20:32:33,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:34,064 INFO L130 PetriNetUnfolder]: 58/276 cut-off events.
[2022-11-02 20:32:34,064 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2022-11-02 20:32:34,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 276 events. 58/276 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1086 event pairs, 10 based on Foata normal form. 17/274 useless extension candidates. Maximal degree in co-relation 353. Up to 79 conditions per place.
[2022-11-02 20:32:34,072 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 14 selfloop transitions, 2 changer transitions 0/114 dead transitions.
[2022-11-02 20:32:34,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 275 flow
[2022-11-02 20:32:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:32:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:32:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions.
[2022-11-02 20:32:34,098 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087
[2022-11-02 20:32:34,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions.
[2022-11-02 20:32:34,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions.
[2022-11-02 20:32:34,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:34,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions.
[2022-11-02 20:32:34,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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)
[2022-11-02 20:32:34,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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)
[2022-11-02 20:32:34,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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)
[2022-11-02 20:32:34,134 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions.
[2022-11-02 20:32:34,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 275 flow
[2022-11-02 20:32:34,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places.
[2022-11-02 20:32:34,147 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow
[2022-11-02 20:32:34,150 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108}
[2022-11-02 20:32:34,155 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places.
[2022-11-02 20:32:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow
[2022-11-02 20:32:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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)
[2022-11-02 20:32:34,157 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:34,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:32:34,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1437227612, now seen corresponding path program 1 times
[2022-11-02 20:32:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:34,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370538481]
[2022-11-02 20:32:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:34,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370538481]
[2022-11-02 20:32:34,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370538481] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:34,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:34,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:32:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091784521]
[2022-11-02 20:32:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:32:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:32:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:32:34,713 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115
[2022-11-02 20:32:34,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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)
[2022-11-02 20:32:34,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:34,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115
[2022-11-02 20:32:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:35,964 INFO L130 PetriNetUnfolder]: 834/2353 cut-off events.
[2022-11-02 20:32:35,964 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES.
[2022-11-02 20:32:35,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 2353 events. 834/2353 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17917 event pairs, 376 based on Foata normal form. 0/2269 useless extension candidates. Maximal degree in co-relation 3726. Up to 732 conditions per place.
[2022-11-02 20:32:35,989 INFO L137 encePairwiseOnDemand]: 108/115 looper letters, 23 selfloop transitions, 3 changer transitions 57/161 dead transitions.
[2022-11-02 20:32:35,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 161 transitions, 494 flow
[2022-11-02 20:32:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:32:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 20:32:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions.
[2022-11-02 20:32:35,996 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629
[2022-11-02 20:32:35,996 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions.
[2022-11-02 20:32:35,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions.
[2022-11-02 20:32:35,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:35,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions.
[2022-11-02 20:32:36,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 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)
[2022-11-02 20:32:36,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2022-11-02 20:32:36,008 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2022-11-02 20:32:36,008 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions.
[2022-11-02 20:32:36,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 161 transitions, 494 flow
[2022-11-02 20:32:36,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 161 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:32:36,016 INFO L231 Difference]: Finished difference. Result has 130 places, 98 transitions, 241 flow
[2022-11-02 20:32:36,017 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=130, PETRI_TRANSITIONS=98}
[2022-11-02 20:32:36,018 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places.
[2022-11-02 20:32:36,018 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 98 transitions, 241 flow
[2022-11-02 20:32:36,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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)
[2022-11-02 20:32:36,019 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:36,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:36,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:32:36,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -522757955, now seen corresponding path program 1 times
[2022-11-02 20:32:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343156600]
[2022-11-02 20:32:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343156600]
[2022-11-02 20:32:36,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343156600] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:36,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:36,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:32:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837196986]
[2022-11-02 20:32:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:36,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:32:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:32:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:32:36,506 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115
[2022-11-02 20:32:36,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 98 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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)
[2022-11-02 20:32:36,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:36,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115
[2022-11-02 20:32:36,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:37,542 INFO L130 PetriNetUnfolder]: 1096/2304 cut-off events.
[2022-11-02 20:32:37,542 INFO L131 PetriNetUnfolder]: For 469/469 co-relation queries the response was YES.
[2022-11-02 20:32:37,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 2304 events. 1096/2304 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15700 event pairs, 92 based on Foata normal form. 0/2209 useless extension candidates. Maximal degree in co-relation 4472. Up to 559 conditions per place.
[2022-11-02 20:32:37,564 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 62 selfloop transitions, 15 changer transitions 10/165 dead transitions.
[2022-11-02 20:32:37,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 165 transitions, 553 flow
[2022-11-02 20:32:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-02 20:32:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-02 20:32:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 999 transitions.
[2022-11-02 20:32:37,568 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8686956521739131
[2022-11-02 20:32:37,568 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 999 transitions.
[2022-11-02 20:32:37,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 999 transitions.
[2022-11-02 20:32:37,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:37,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 999 transitions.
[2022-11-02 20:32:37,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.9) internal successors, (999), 10 states have internal predecessors, (999), 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)
[2022-11-02 20:32:37,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2022-11-02 20:32:37,577 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2022-11-02 20:32:37,577 INFO L175 Difference]: Start difference. First operand has 130 places, 98 transitions, 241 flow. Second operand 10 states and 999 transitions.
[2022-11-02 20:32:37,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 165 transitions, 553 flow
[2022-11-02 20:32:37,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 165 transitions, 544 flow, removed 3 selfloop flow, removed 4 redundant places.
[2022-11-02 20:32:37,592 INFO L231 Difference]: Finished difference. Result has 123 places, 111 transitions, 341 flow
[2022-11-02 20:32:37,592 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=123, PETRI_TRANSITIONS=111}
[2022-11-02 20:32:37,595 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 3 predicate places.
[2022-11-02 20:32:37,595 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 111 transitions, 341 flow
[2022-11-02 20:32:37,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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)
[2022-11-02 20:32:37,596 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:37,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:32:37,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 530243215, now seen corresponding path program 1 times
[2022-11-02 20:32:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:37,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161349859]
[2022-11-02 20:32:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161349859]
[2022-11-02 20:32:37,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161349859] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:37,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:37,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:32:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261006771]
[2022-11-02 20:32:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:32:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:32:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:32:37,975 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115
[2022-11-02 20:32:37,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 111 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2022-11-02 20:32:37,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:37,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115
[2022-11-02 20:32:37,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:39,108 INFO L130 PetriNetUnfolder]: 892/2772 cut-off events.
[2022-11-02 20:32:39,109 INFO L131 PetriNetUnfolder]: For 1873/1971 co-relation queries the response was YES.
[2022-11-02 20:32:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6391 conditions, 2772 events. 892/2772 cut-off events. For 1873/1971 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 24110 event pairs, 244 based on Foata normal form. 57/2684 useless extension candidates. Maximal degree in co-relation 6325. Up to 681 conditions per place.
[2022-11-02 20:32:39,175 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 38 selfloop transitions, 10 changer transitions 33/169 dead transitions.
[2022-11-02 20:32:39,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 169 transitions, 697 flow
[2022-11-02 20:32:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:32:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 20:32:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions.
[2022-11-02 20:32:39,179 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.851207729468599
[2022-11-02 20:32:39,180 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions.
[2022-11-02 20:32:39,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions.
[2022-11-02 20:32:39,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:39,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions.
[2022-11-02 20:32:39,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 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)
[2022-11-02 20:32:39,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2022-11-02 20:32:39,193 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2022-11-02 20:32:39,194 INFO L175 Difference]: Start difference. First operand has 123 places, 111 transitions, 341 flow. Second operand 9 states and 881 transitions.
[2022-11-02 20:32:39,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 169 transitions, 697 flow
[2022-11-02 20:32:39,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 169 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:32:39,214 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 455 flow
[2022-11-02 20:32:39,215 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=455, PETRI_PLACES=138, PETRI_TRANSITIONS=119}
[2022-11-02 20:32:39,218 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 18 predicate places.
[2022-11-02 20:32:39,218 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 455 flow
[2022-11-02 20:32:39,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2022-11-02 20:32:39,219 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:39,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:32:39,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2030612187, now seen corresponding path program 1 times
[2022-11-02 20:32:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:39,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962006349]
[2022-11-02 20:32:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962006349]
[2022-11-02 20:32:39,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962006349] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:39,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:39,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 20:32:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989812319]
[2022-11-02 20:32:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:39,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 20:32:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 20:32:39,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:32:39,604 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115
[2022-11-02 20:32:39,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 455 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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)
[2022-11-02 20:32:39,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:39,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115
[2022-11-02 20:32:39,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:41,311 INFO L130 PetriNetUnfolder]: 1988/4122 cut-off events.
[2022-11-02 20:32:41,311 INFO L131 PetriNetUnfolder]: For 6743/6964 co-relation queries the response was YES.
[2022-11-02 20:32:41,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12251 conditions, 4122 events. 1988/4122 cut-off events. For 6743/6964 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 31690 event pairs, 155 based on Foata normal form. 90/4103 useless extension candidates. Maximal degree in co-relation 12178. Up to 706 conditions per place.
[2022-11-02 20:32:41,347 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 73 selfloop transitions, 26 changer transitions 36/217 dead transitions.
[2022-11-02 20:32:41,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 217 transitions, 1195 flow
[2022-11-02 20:32:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-11-02 20:32:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2022-11-02 20:32:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1300 transitions.
[2022-11-02 20:32:41,351 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043
[2022-11-02 20:32:41,351 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1300 transitions.
[2022-11-02 20:32:41,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1300 transitions.
[2022-11-02 20:32:41,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:41,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1300 transitions.
[2022-11-02 20:32:41,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.0) internal successors, (1300), 13 states have internal predecessors, (1300), 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)
[2022-11-02 20:32:41,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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)
[2022-11-02 20:32:41,359 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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)
[2022-11-02 20:32:41,359 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 455 flow. Second operand 13 states and 1300 transitions.
[2022-11-02 20:32:41,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 217 transitions, 1195 flow
[2022-11-02 20:32:41,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 217 transitions, 1185 flow, removed 5 selfloop flow, removed 3 redundant places.
[2022-11-02 20:32:41,396 INFO L231 Difference]: Finished difference. Result has 150 places, 131 transitions, 634 flow
[2022-11-02 20:32:41,397 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=634, PETRI_PLACES=150, PETRI_TRANSITIONS=131}
[2022-11-02 20:32:41,398 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 30 predicate places.
[2022-11-02 20:32:41,398 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 131 transitions, 634 flow
[2022-11-02 20:32:41,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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)
[2022-11-02 20:32:41,398 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:41,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:41,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:32:41,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:41,400 INFO L85 PathProgramCache]: Analyzing trace with hash -453572812, now seen corresponding path program 1 times
[2022-11-02 20:32:41,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:41,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010358726]
[2022-11-02 20:32:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:41,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010358726]
[2022-11-02 20:32:41,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010358726] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:41,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:41,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-11-02 20:32:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229792512]
[2022-11-02 20:32:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-11-02 20:32:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-11-02 20:32:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:32:41,754 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115
[2022-11-02 20:32:41,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 131 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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)
[2022-11-02 20:32:41,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:41,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115
[2022-11-02 20:32:41,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:43,550 INFO L130 PetriNetUnfolder]: 1757/3716 cut-off events.
[2022-11-02 20:32:43,550 INFO L131 PetriNetUnfolder]: For 9593/9826 co-relation queries the response was YES.
[2022-11-02 20:32:43,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 3716 events. 1757/3716 cut-off events. For 9593/9826 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 29734 event pairs, 148 based on Foata normal form. 47/3656 useless extension candidates. Maximal degree in co-relation 12561. Up to 567 conditions per place.
[2022-11-02 20:32:43,589 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 62 selfloop transitions, 30 changer transitions 34/208 dead transitions.
[2022-11-02 20:32:43,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 208 transitions, 1272 flow
[2022-11-02 20:32:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-11-02 20:32:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2022-11-02 20:32:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1558 transitions.
[2022-11-02 20:32:43,594 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8467391304347827
[2022-11-02 20:32:43,595 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1558 transitions.
[2022-11-02 20:32:43,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1558 transitions.
[2022-11-02 20:32:43,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:43,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1558 transitions.
[2022-11-02 20:32:43,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.375) internal successors, (1558), 16 states have internal predecessors, (1558), 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)
[2022-11-02 20:32:43,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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)
[2022-11-02 20:32:43,605 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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)
[2022-11-02 20:32:43,605 INFO L175 Difference]: Start difference. First operand has 150 places, 131 transitions, 634 flow. Second operand 16 states and 1558 transitions.
[2022-11-02 20:32:43,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 208 transitions, 1272 flow
[2022-11-02 20:32:43,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 208 transitions, 1138 flow, removed 46 selfloop flow, removed 9 redundant places.
[2022-11-02 20:32:43,853 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 626 flow
[2022-11-02 20:32:43,854 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=626, PETRI_PLACES=160, PETRI_TRANSITIONS=132}
[2022-11-02 20:32:43,857 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places.
[2022-11-02 20:32:43,858 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 626 flow
[2022-11-02 20:32:43,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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)
[2022-11-02 20:32:43,859 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:43,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:32:43,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1125463742, now seen corresponding path program 1 times
[2022-11-02 20:32:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280820314]
[2022-11-02 20:32:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:45,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280820314]
[2022-11-02 20:32:45,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280820314] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-11-02 20:32:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230926378]
[2022-11-02 20:32:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-11-02 20:32:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-11-02 20:32:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:32:45,361 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115
[2022-11-02 20:32:45,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 626 flow. Second operand has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 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)
[2022-11-02 20:32:45,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:45,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115
[2022-11-02 20:32:45,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:46,184 INFO L130 PetriNetUnfolder]: 381/2214 cut-off events.
[2022-11-02 20:32:46,184 INFO L131 PetriNetUnfolder]: For 5969/6126 co-relation queries the response was YES.
[2022-11-02 20:32:46,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6999 conditions, 2214 events. 381/2214 cut-off events. For 5969/6126 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24612 event pairs, 13 based on Foata normal form. 1/2103 useless extension candidates. Maximal degree in co-relation 6910. Up to 301 conditions per place.
[2022-11-02 20:32:46,217 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 29 selfloop transitions, 6 changer transitions 11/154 dead transitions.
[2022-11-02 20:32:46,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 154 transitions, 792 flow
[2022-11-02 20:32:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-11-02 20:32:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-11-02 20:32:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions.
[2022-11-02 20:32:46,221 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7913043478260869
[2022-11-02 20:32:46,221 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions.
[2022-11-02 20:32:46,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions.
[2022-11-02 20:32:46,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:46,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions.
[2022-11-02 20:32:46,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 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)
[2022-11-02 20:32:46,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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)
[2022-11-02 20:32:46,228 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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)
[2022-11-02 20:32:46,229 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 626 flow. Second operand 11 states and 1001 transitions.
[2022-11-02 20:32:46,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 154 transitions, 792 flow
[2022-11-02 20:32:46,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 677 flow, removed 27 selfloop flow, removed 18 redundant places.
[2022-11-02 20:32:46,363 INFO L231 Difference]: Finished difference. Result has 155 places, 134 transitions, 562 flow
[2022-11-02 20:32:46,363 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=562, PETRI_PLACES=155, PETRI_TRANSITIONS=134}
[2022-11-02 20:32:46,365 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 35 predicate places.
[2022-11-02 20:32:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 562 flow
[2022-11-02 20:32:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 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)
[2022-11-02 20:32:46,367 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:46,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:46,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:32:46,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1351997540, now seen corresponding path program 2 times
[2022-11-02 20:32:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:46,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964910429]
[2022-11-02 20:32:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:32:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:32:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:32:48,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964910429]
[2022-11-02 20:32:48,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964910429] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:32:48,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:32:48,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-11-02 20:32:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534405790]
[2022-11-02 20:32:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:32:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-11-02 20:32:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:32:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-11-02 20:32:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:32:48,638 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115
[2022-11-02 20:32:48,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 562 flow. Second operand has 11 states, 11 states have (on average 84.54545454545455) internal successors, (930), 11 states have internal predecessors, (930), 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)
[2022-11-02 20:32:48,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:32:48,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115
[2022-11-02 20:32:48,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:32:49,819 INFO L130 PetriNetUnfolder]: 473/2618 cut-off events.
[2022-11-02 20:32:49,819 INFO L131 PetriNetUnfolder]: For 3538/3564 co-relation queries the response was YES.
[2022-11-02 20:32:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 2618 events. 473/2618 cut-off events. For 3538/3564 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30421 event pairs, 8 based on Foata normal form. 4/2501 useless extension candidates. Maximal degree in co-relation 6991. Up to 281 conditions per place.
[2022-11-02 20:32:49,846 INFO L137 encePairwiseOnDemand]: 101/115 looper letters, 50 selfloop transitions, 21 changer transitions 15/183 dead transitions.
[2022-11-02 20:32:49,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 183 transitions, 953 flow
[2022-11-02 20:32:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-11-02 20:32:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-11-02 20:32:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1230 transitions.
[2022-11-02 20:32:49,851 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7639751552795031
[2022-11-02 20:32:49,851 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1230 transitions.
[2022-11-02 20:32:49,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1230 transitions.
[2022-11-02 20:32:49,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:32:49,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1230 transitions.
[2022-11-02 20:32:49,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.85714285714286) internal successors, (1230), 14 states have internal predecessors, (1230), 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)
[2022-11-02 20:32:49,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2022-11-02 20:32:49,860 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2022-11-02 20:32:49,860 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 562 flow. Second operand 14 states and 1230 transitions.
[2022-11-02 20:32:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 183 transitions, 953 flow
[2022-11-02 20:32:49,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 183 transitions, 903 flow, removed 16 selfloop flow, removed 9 redundant places.
[2022-11-02 20:32:49,980 INFO L231 Difference]: Finished difference. Result has 159 places, 145 transitions, 655 flow
[2022-11-02 20:32:49,981 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=655, PETRI_PLACES=159, PETRI_TRANSITIONS=145}
[2022-11-02 20:32:49,981 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 39 predicate places.
[2022-11-02 20:32:49,982 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 655 flow
[2022-11-02 20:32:49,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.54545454545455) internal successors, (930), 11 states have internal predecessors, (930), 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)
[2022-11-02 20:32:49,983 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:32:49,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:49,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:32:49,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2022-11-02 20:32:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:32:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -231313458, now seen corresponding path program 3 times
[2022-11-02 20:32:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:32:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509773898]
[2022-11-02 20:32:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:32:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:32:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:32:50,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:32:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:32:50,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:32:50,256 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:32:50,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2022-11-02 20:32:50,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2022-11-02 20:32:50,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2022-11-02 20:32:50,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2022-11-02 20:32:50,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2022-11-02 20:32:50,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2022-11-02 20:32:50,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:32:50,261 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:32:50,269 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-02 20:32:50,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:32:50,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:32:50 BasicIcfg
[2022-11-02 20:32:50,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:32:50,445 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:32:50,445 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:32:50,445 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:32:50,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:32" (3/4) ...
[2022-11-02 20:32:50,448 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-02 20:32:50,639 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:32:50,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:32:50,640 INFO L158 Benchmark]: Toolchain (without parser) took 20565.44ms. Allocated memory was 144.7MB in the beginning and 868.2MB in the end (delta: 723.5MB). Free memory was 109.9MB in the beginning and 407.2MB in the end (delta: -297.2MB). Peak memory consumption was 425.0MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,640 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 90.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:32:50,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.51ms. Allocated memory is still 144.7MB. Free memory was 109.7MB in the beginning and 107.0MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.23ms. Allocated memory is still 144.7MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,642 INFO L158 Benchmark]: Boogie Preprocessor took 44.67ms. Allocated memory is still 144.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,643 INFO L158 Benchmark]: RCFGBuilder took 1558.29ms. Allocated memory is still 144.7MB. Free memory was 102.1MB in the beginning and 63.5MB in the end (delta: 38.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,643 INFO L158 Benchmark]: TraceAbstraction took 17930.41ms. Allocated memory was 144.7MB in the beginning and 868.2MB in the end (delta: 723.5MB). Free memory was 62.6MB in the beginning and 441.8MB in the end (delta: -379.2MB). Peak memory consumption was 345.1MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,644 INFO L158 Benchmark]: Witness Printer took 194.09ms. Allocated memory is still 868.2MB. Free memory was 441.8MB in the beginning and 407.2MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2022-11-02 20:32:50,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.29ms. Allocated memory is still 90.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 767.51ms. Allocated memory is still 144.7MB. Free memory was 109.7MB in the beginning and 107.0MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 59.23ms. Allocated memory is still 144.7MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 44.67ms. Allocated memory is still 144.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1558.29ms. Allocated memory is still 144.7MB. Free memory was 102.1MB in the beginning and 63.5MB in the end (delta: 38.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 17930.41ms. Allocated memory was 144.7MB in the beginning and 868.2MB in the end (delta: 723.5MB). Free memory was 62.6MB in the beginning and 441.8MB in the end (delta: -379.2MB). Peak memory consumption was 345.1MB. Max. memory is 16.1GB.
* Witness Printer took 194.09ms. Allocated memory is still 868.2MB. Free memory was 441.8MB in the beginning and 407.2MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L713] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0]
[L714] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0]
[L715] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L721] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L722] 0 _Bool z$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L723] 0 int z$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L724] 0 _Bool z$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0]
[L725] 0 _Bool z$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0]
[L726] 0 _Bool z$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0]
[L727] 0 _Bool z$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0]
[L728] 0 _Bool z$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0]
[L729] 0 _Bool z$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0]
[L730] 0 _Bool z$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0]
[L731] 0 _Bool z$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0]
[L732] 0 _Bool z$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0]
[L733] 0 int *z$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}]
[L734] 0 int z$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0]
[L735] 0 _Bool z$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0]
[L736] 0 int z$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0]
[L737] 0 _Bool z$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L738] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L739] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L833] 0 pthread_t t1385;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-2, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L835] 0 pthread_t t1386;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=-1, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837] 0 pthread_t t1387;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L743] 1 z$w_buff1 = z$w_buff0
[L744] 1 z$w_buff0 = 1
[L745] 1 z$w_buff1_used = z$w_buff0_used
[L746] 1 z$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L752] 1 z$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L772] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L775] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L792] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L795] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L796] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L797] 3 z$flush_delayed = weak$$choice2
[L798] 3 z$mem_tmp = z
[L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)
[L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)
[L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L806] 3 __unbuffered_p2_EAX = z
[L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L807] 3 z = z$flush_delayed ? z$mem_tmp : z
[L808] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L842] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L842] RET 0 assume_abort_if_not(main$tmp_guard0)
[L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L853] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 142 locations, 6 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: 17.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 82 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=8, InterpolantAutomatonStates: 85, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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!
[2022-11-02 20:32:50,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d78b18-b8d6-4acb-9cfc-e0cef85970b1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE