/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:39:50,883 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:39:50,886 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:39:50,915 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:39:50,915 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:39:50,916 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:39:50,918 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:39:50,919 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:39:50,921 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:39:50,922 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:39:50,923 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:39:50,924 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:39:50,924 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:39:50,925 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:39:50,926 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:39:50,928 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:39:50,928 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:39:50,929 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:39:50,931 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:39:50,933 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:39:50,934 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:39:50,935 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:39:50,936 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:39:50,937 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:39:50,940 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:39:50,940 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:39:50,940 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:39:50,941 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:39:50,941 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:39:50,942 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:39:50,943 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:39:50,943 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:39:50,944 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:39:50,945 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:39:50,946 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:39:50,946 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:39:50,947 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:39:50,947 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:39:50,947 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:39:50,951 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:39:50,952 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:39:50,956 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2020-10-16 01:39:50,997 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:39:50,998 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:39:51,000 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:39:51,000 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:39:51,001 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:39:51,001 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:39:51,001 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:39:51,001 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:39:51,001 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:39:51,002 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:39:51,003 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:39:51,003 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:39:51,003 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:39:51,003 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:39:51,004 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:39:51,005 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:39:51,005 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:39:51,005 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:39:51,005 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:39:51,005 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:39:51,006 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:39:51,006 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:39:51,006 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:39:51,006 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:39:51,006 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:39:51,007 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:39:51,007 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:39:51,007 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:39:51,007 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:39:51,333 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:39:51,346 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:39:51,349 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:39:51,351 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:39:51,351 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:39:51,352 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i
[2020-10-16 01:39:51,428 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cc9595b/d2d14538d23244b98bb85e5ca45d3fb1/FLAGb3039e75c
[2020-10-16 01:39:51,982 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:39:51,983 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i
[2020-10-16 01:39:52,008 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cc9595b/d2d14538d23244b98bb85e5ca45d3fb1/FLAGb3039e75c
[2020-10-16 01:39:52,239 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cc9595b/d2d14538d23244b98bb85e5ca45d3fb1
[2020-10-16 01:39:52,250 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:39:52,252 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:39:52,253 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:52,253 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:39:52,257 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:39:52,258 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:52,261 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc77a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52, skipping insertion in model container
[2020-10-16 01:39:52,261 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:52,269 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:39:52,308 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:39:52,676 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:52,801 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:39:52,888 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:52,976 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:39:52,976 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52 WrapperNode
[2020-10-16 01:39:52,977 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:52,978 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:52,978 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:39:52,978 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:39:52,988 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,008 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,042 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:53,043 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:39:53,043 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:39:53,043 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:39:53,054 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,055 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,059 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,060 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,070 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,074 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,078 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
[2020-10-16 01:39:53,083 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:39:53,084 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:39:53,087 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:39:53,087 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:39:53,088 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:39:53,193 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-10-16 01:39:53,194 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:39:53,194 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:39:53,194 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:39:53,194 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:39:53,195 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:39:53,196 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:39:53,196 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:39:53,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:39:53,197 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:39:53,199 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:39:53,200 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-16 01:39:53,200 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:39:53,200 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:39:53,200 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:39:53,202 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 01:39:55,044 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:39:55,044 INFO  L298             CfgBuilder]: Removed 8 assume(true) statements.
[2020-10-16 01:39:55,046 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:55 BoogieIcfgContainer
[2020-10-16 01:39:55,047 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:39:55,048 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:39:55,048 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:39:55,052 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:39:55,052 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:39:52" (1/3) ...
[2020-10-16 01:39:55,053 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29392852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:55, skipping insertion in model container
[2020-10-16 01:39:55,053 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:52" (2/3) ...
[2020-10-16 01:39:55,053 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29392852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:55, skipping insertion in model container
[2020-10-16 01:39:55,054 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:55" (3/3) ...
[2020-10-16 01:39:55,055 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i
[2020-10-16 01:39:55,067 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:39:55,075 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-10-16 01:39:55,076 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:39:55,107 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,108 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,108 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,108 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,108 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,116 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,116 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,116 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,118 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,118 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,119 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,119 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,119 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,119 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,120 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,120 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,120 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,120 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,121 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,121 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,122 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,122 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,122 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,128 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,128 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,128 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,129 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,130 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,130 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,134 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,134 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,134 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,134 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,135 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,135 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,135 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,135 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,135 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,136 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,136 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,136 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,136 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,136 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,137 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,137 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,137 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,137 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,137 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,138 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,138 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,138 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,138 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,138 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,140 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,140 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,143 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,144 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,144 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,144 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:55,161 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2020-10-16 01:39:55,183 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:39:55,184 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:39:55,184 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:39:55,184 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:39:55,184 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:39:55,184 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:39:55,184 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:39:55,184 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:39:55,200 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow
[2020-10-16 01:39:55,253 INFO  L129       PetriNetUnfolder]: 2/105 cut-off events.
[2020-10-16 01:39:55,254 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:55,259 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. 
[2020-10-16 01:39:55,259 INFO  L82        GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow
[2020-10-16 01:39:55,267 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 103 places, 94 transitions, 197 flow
[2020-10-16 01:39:55,270 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:39:55,273 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 94 transitions, 197 flow
[2020-10-16 01:39:55,276 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 94 transitions, 197 flow
[2020-10-16 01:39:55,277 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 103 places, 94 transitions, 197 flow
[2020-10-16 01:39:55,303 INFO  L129       PetriNetUnfolder]: 1/94 cut-off events.
[2020-10-16 01:39:55,303 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:55,304 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 1/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. 
[2020-10-16 01:39:55,307 INFO  L117        LiptonReduction]: Number of co-enabled transitions 954
[2020-10-16 01:39:55,917 WARN  L193               SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70
[2020-10-16 01:39:55,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:55,938 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:55,941 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:55,941 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,051 WARN  L193               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63
[2020-10-16 01:39:56,140 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:56,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:56,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:56,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,166 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:56,166 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term
[2020-10-16 01:39:56,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term
[2020-10-16 01:39:56,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,421 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:56,421 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,422 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:56,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:56,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:56,442 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:56,442 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:57,970 WARN  L193               SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 238 DAG size of output: 198
[2020-10-16 01:39:57,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term
[2020-10-16 01:39:57,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,659 WARN  L193               SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111
[2020-10-16 01:39:58,809 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,831 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:58,831 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,834 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,834 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:58,837 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,838 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:58,839 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,841 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,842 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,843 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,844 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,845 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,849 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,854 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,855 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:58,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:58,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:58,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:58,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:58,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:58,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:58,985 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term
[2020-10-16 01:39:58,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:59,000 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term
[2020-10-16 01:39:59,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2020-10-16 01:39:59,001 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,111 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,111 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:59,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term
[2020-10-16 01:39:59,118 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:59,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:39:59,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:59,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:59,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:59,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,144 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,322 WARN  L193               SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 65
[2020-10-16 01:39:59,471 WARN  L193               SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 65
[2020-10-16 01:39:59,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,642 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:59,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term
[2020-10-16 01:40:00,191 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:40:00,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term
[2020-10-16 01:40:00,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,225 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:40:00,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term
[2020-10-16 01:40:00,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:40:00,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,237 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,241 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,241 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,242 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,244 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,497 WARN  L193               SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44
[2020-10-16 01:40:00,635 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-10-16 01:40:00,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term
[2020-10-16 01:40:00,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,662 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:40:00,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,669 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,671 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,672 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:40:00,672 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,674 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:00,697 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term
[2020-10-16 01:40:00,697 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:40:00,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term
[2020-10-16 01:40:00,700 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:40:00,729 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:01,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:01,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:40:01,344 WARN  L193               SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107
[2020-10-16 01:40:01,496 WARN  L193               SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 105
[2020-10-16 01:40:02,005 WARN  L193               SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134
[2020-10-16 01:40:02,251 WARN  L193               SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 130
[2020-10-16 01:40:02,256 INFO  L132        LiptonReduction]: Checked pairs total: 2520
[2020-10-16 01:40:02,256 INFO  L134        LiptonReduction]: Total number of compositions: 77
[2020-10-16 01:40:02,259 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6992
[2020-10-16 01:40:02,270 INFO  L129       PetriNetUnfolder]: 0/17 cut-off events.
[2020-10-16 01:40:02,270 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:40:02,270 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:02,271 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:02,272 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:02,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:02,278 INFO  L82        PathProgramCache]: Analyzing trace with hash 1197949936, now seen corresponding path program 1 times
[2020-10-16 01:40:02,286 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:02,286 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517635515]
[2020-10-16 01:40:02,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:02,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:02,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:02,567 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517635515]
[2020-10-16 01:40:02,568 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:02,568 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:40:02,569 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391531407]
[2020-10-16 01:40:02,579 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:40:02,580 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:02,597 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:40:02,599 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:40:02,602 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185
[2020-10-16 01:40:02,604 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states.
[2020-10-16 01:40:02,605 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:02,605 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185
[2020-10-16 01:40:02,606 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:02,653 INFO  L129       PetriNetUnfolder]: 21/78 cut-off events.
[2020-10-16 01:40:02,653 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:40:02,654 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 130 conditions, 78 events. 21/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 276 event pairs, 11 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 120. Up to 37 conditions per place. 
[2020-10-16 01:40:02,656 INFO  L132   encePairwiseOnDemand]: 182/185 looper letters, 6 selfloop transitions, 2 changer transitions 0/21 dead transitions.
[2020-10-16 01:40:02,656 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 67 flow
[2020-10-16 01:40:02,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:40:02,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:40:02,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2020-10-16 01:40:02,704 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.9027027027027027
[2020-10-16 01:40:02,705 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,705 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,708 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:02,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,715 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:40:02,723 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:40:02,724 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:40:02,726 INFO  L185             Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 501 transitions.
[2020-10-16 01:40:02,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 67 flow
[2020-10-16 01:40:02,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 64 flow, removed 0 selfloop flow, removed 3 redundant places.
[2020-10-16 01:40:02,732 INFO  L241             Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow
[2020-10-16 01:40:02,735 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19}
[2020-10-16 01:40:02,736 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places.
[2020-10-16 01:40:02,736 INFO  L481      AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow
[2020-10-16 01:40:02,736 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:40:02,736 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:02,737 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:02,737 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:40:02,737 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:02,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:02,738 INFO  L82        PathProgramCache]: Analyzing trace with hash 1744614458, now seen corresponding path program 1 times
[2020-10-16 01:40:02,738 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:02,738 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776570521]
[2020-10-16 01:40:02,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:02,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:02,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:02,837 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776570521]
[2020-10-16 01:40:02,837 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:02,837 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:40:02,837 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361200810]
[2020-10-16 01:40:02,839 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:40:02,839 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:02,840 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:40:02,840 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:40:02,843 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185
[2020-10-16 01:40:02,843 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states.
[2020-10-16 01:40:02,845 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:02,845 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185
[2020-10-16 01:40:02,845 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:02,879 INFO  L129       PetriNetUnfolder]: 13/47 cut-off events.
[2020-10-16 01:40:02,879 INFO  L130       PetriNetUnfolder]: For 11/30 co-relation queries the response was YES.
[2020-10-16 01:40:02,881 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 47 events. 13/47 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 9 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 89. Up to 22 conditions per place. 
[2020-10-16 01:40:02,882 INFO  L132   encePairwiseOnDemand]: 182/185 looper letters, 6 selfloop transitions, 2 changer transitions 0/21 dead transitions.
[2020-10-16 01:40:02,882 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 72 flow
[2020-10-16 01:40:02,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:40:02,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:40:02,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2020-10-16 01:40:02,885 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.9027027027027027
[2020-10-16 01:40:02,886 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,886 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,886 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:02,886 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2020-10-16 01:40:02,887 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:40:02,888 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:40:02,889 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:40:02,889 INFO  L185             Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 501 transitions.
[2020-10-16 01:40:02,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 72 flow
[2020-10-16 01:40:02,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:40:02,890 INFO  L241             Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow
[2020-10-16 01:40:02,891 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19}
[2020-10-16 01:40:02,891 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places.
[2020-10-16 01:40:02,891 INFO  L481      AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow
[2020-10-16 01:40:02,892 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:40:02,892 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:02,892 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:02,892 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:40:02,892 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:02,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:02,893 INFO  L82        PathProgramCache]: Analyzing trace with hash 178629012, now seen corresponding path program 1 times
[2020-10-16 01:40:02,893 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:02,893 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397768443]
[2020-10-16 01:40:02,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:02,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:03,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:03,015 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397768443]
[2020-10-16 01:40:03,015 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:03,016 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:40:03,016 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53849934]
[2020-10-16 01:40:03,016 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:40:03,016 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:03,017 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:40:03,017 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:40:03,019 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 185
[2020-10-16 01:40:03,019 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand 3 states.
[2020-10-16 01:40:03,019 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:03,020 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 185
[2020-10-16 01:40:03,020 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:03,032 INFO  L129       PetriNetUnfolder]: 0/19 cut-off events.
[2020-10-16 01:40:03,032 INFO  L130       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2020-10-16 01:40:03,032 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 39 conditions, 19 events. 0/19 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2020-10-16 01:40:03,032 INFO  L132   encePairwiseOnDemand]: 182/185 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions.
[2020-10-16 01:40:03,032 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 19 transitions, 62 flow
[2020-10-16 01:40:03,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:40:03,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:40:03,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions.
[2020-10-16 01:40:03,035 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.9207207207207208
[2020-10-16 01:40:03,035 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 511 transitions.
[2020-10-16 01:40:03,035 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions.
[2020-10-16 01:40:03,036 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:03,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions.
[2020-10-16 01:40:03,037 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:40:03,041 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:40:03,041 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:40:03,041 INFO  L185             Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 3 states and 511 transitions.
[2020-10-16 01:40:03,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 19 transitions, 62 flow
[2020-10-16 01:40:03,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 19 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:40:03,044 INFO  L241             Difference]: Finished difference. Result has 31 places, 19 transitions, 60 flow
[2020-10-16 01:40:03,045 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=19}
[2020-10-16 01:40:03,045 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places.
[2020-10-16 01:40:03,045 INFO  L481      AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 60 flow
[2020-10-16 01:40:03,045 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:40:03,045 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:03,045 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:03,046 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:40:03,046 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:03,046 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:03,046 INFO  L82        PathProgramCache]: Analyzing trace with hash 2016390827, now seen corresponding path program 1 times
[2020-10-16 01:40:03,047 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:03,047 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482495660]
[2020-10-16 01:40:03,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:03,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:03,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:03,158 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482495660]
[2020-10-16 01:40:03,158 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:03,158 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:40:03,159 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241448212]
[2020-10-16 01:40:03,159 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:40:03,159 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:03,160 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:40:03,160 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:40:03,161 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185
[2020-10-16 01:40:03,162 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 60 flow. Second operand 3 states.
[2020-10-16 01:40:03,162 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:03,162 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185
[2020-10-16 01:40:03,162 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:03,179 INFO  L129       PetriNetUnfolder]: 0/19 cut-off events.
[2020-10-16 01:40:03,179 INFO  L130       PetriNetUnfolder]: For 14/16 co-relation queries the response was YES.
[2020-10-16 01:40:03,180 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2020-10-16 01:40:03,180 INFO  L132   encePairwiseOnDemand]: 182/185 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions.
[2020-10-16 01:40:03,180 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 19 transitions, 66 flow
[2020-10-16 01:40:03,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:40:03,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:40:03,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2020-10-16 01:40:03,183 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8936936936936937
[2020-10-16 01:40:03,183 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2020-10-16 01:40:03,183 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2020-10-16 01:40:03,184 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:03,184 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2020-10-16 01:40:03,185 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:40:03,187 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:40:03,187 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:40:03,188 INFO  L185             Difference]: Start difference. First operand has 31 places, 19 transitions, 60 flow. Second operand 3 states and 496 transitions.
[2020-10-16 01:40:03,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 19 transitions, 66 flow
[2020-10-16 01:40:03,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 19 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:40:03,189 INFO  L241             Difference]: Finished difference. Result has 32 places, 19 transitions, 64 flow
[2020-10-16 01:40:03,190 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=19}
[2020-10-16 01:40:03,190 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places.
[2020-10-16 01:40:03,190 INFO  L481      AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 64 flow
[2020-10-16 01:40:03,190 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:40:03,190 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:03,191 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:03,191 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:40:03,191 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:03,191 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:03,191 INFO  L82        PathProgramCache]: Analyzing trace with hash -136216585, now seen corresponding path program 1 times
[2020-10-16 01:40:03,192 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:03,192 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770977084]
[2020-10-16 01:40:03,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:03,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:03,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:03,396 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770977084]
[2020-10-16 01:40:03,396 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:03,396 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:40:03,397 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266549469]
[2020-10-16 01:40:03,397 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:40:03,397 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:03,397 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:40:03,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:40:03,400 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 185
[2020-10-16 01:40:03,400 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 64 flow. Second operand 7 states.
[2020-10-16 01:40:03,401 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:03,401 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 185
[2020-10-16 01:40:03,401 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:03,523 INFO  L129       PetriNetUnfolder]: 14/62 cut-off events.
[2020-10-16 01:40:03,523 INFO  L130       PetriNetUnfolder]: For 42/46 co-relation queries the response was YES.
[2020-10-16 01:40:03,524 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 153 conditions, 62 events. 14/62 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 197 event pairs, 1 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 140. Up to 23 conditions per place. 
[2020-10-16 01:40:03,524 INFO  L132   encePairwiseOnDemand]: 180/185 looper letters, 10 selfloop transitions, 5 changer transitions 0/26 dead transitions.
[2020-10-16 01:40:03,524 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 119 flow
[2020-10-16 01:40:03,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:40:03,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:40:03,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions.
[2020-10-16 01:40:03,527 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.6648648648648648
[2020-10-16 01:40:03,527 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 492 transitions.
[2020-10-16 01:40:03,528 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions.
[2020-10-16 01:40:03,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:03,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions.
[2020-10-16 01:40:03,530 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:40:03,531 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:40:03,531 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:40:03,531 INFO  L185             Difference]: Start difference. First operand has 32 places, 19 transitions, 64 flow. Second operand 4 states and 492 transitions.
[2020-10-16 01:40:03,531 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 119 flow
[2020-10-16 01:40:03,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 113 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:40:03,533 INFO  L241             Difference]: Finished difference. Result has 35 places, 22 transitions, 90 flow
[2020-10-16 01:40:03,534 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=22}
[2020-10-16 01:40:03,534 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places.
[2020-10-16 01:40:03,534 INFO  L481      AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 90 flow
[2020-10-16 01:40:03,534 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:40:03,534 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:03,535 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:03,535 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:40:03,535 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:03,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:03,535 INFO  L82        PathProgramCache]: Analyzing trace with hash -629846677, now seen corresponding path program 2 times
[2020-10-16 01:40:03,536 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:03,536 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045872340]
[2020-10-16 01:40:03,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:03,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:03,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:03,580 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045872340]
[2020-10-16 01:40:03,581 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:03,581 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:40:03,581 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189265152]
[2020-10-16 01:40:03,583 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:40:03,583 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:03,584 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:40:03,584 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:40:03,585 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 185
[2020-10-16 01:40:03,586 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 90 flow. Second operand 4 states.
[2020-10-16 01:40:03,586 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:03,586 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 185
[2020-10-16 01:40:03,586 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:03,638 INFO  L129       PetriNetUnfolder]: 28/114 cut-off events.
[2020-10-16 01:40:03,638 INFO  L130       PetriNetUnfolder]: For 189/261 co-relation queries the response was YES.
[2020-10-16 01:40:03,639 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 282 conditions, 114 events. 28/114 cut-off events. For 189/261 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 549 event pairs, 2 based on Foata normal form. 13/123 useless extension candidates. Maximal degree in co-relation 267. Up to 24 conditions per place. 
[2020-10-16 01:40:03,640 INFO  L132   encePairwiseOnDemand]: 181/185 looper letters, 6 selfloop transitions, 3 changer transitions 1/26 dead transitions.
[2020-10-16 01:40:03,640 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 120 flow
[2020-10-16 01:40:03,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:40:03,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:40:03,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 655 transitions.
[2020-10-16 01:40:03,646 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8851351351351351
[2020-10-16 01:40:03,646 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 655 transitions.
[2020-10-16 01:40:03,647 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 655 transitions.
[2020-10-16 01:40:03,647 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:03,647 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 655 transitions.
[2020-10-16 01:40:03,649 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:40:03,650 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:40:03,651 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:40:03,651 INFO  L185             Difference]: Start difference. First operand has 35 places, 22 transitions, 90 flow. Second operand 4 states and 655 transitions.
[2020-10-16 01:40:03,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 120 flow
[2020-10-16 01:40:03,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:40:03,656 INFO  L241             Difference]: Finished difference. Result has 38 places, 22 transitions, 97 flow
[2020-10-16 01:40:03,656 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=22}
[2020-10-16 01:40:03,656 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places.
[2020-10-16 01:40:03,656 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 97 flow
[2020-10-16 01:40:03,656 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:40:03,657 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:03,657 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:03,657 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:40:03,657 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:03,657 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:03,657 INFO  L82        PathProgramCache]: Analyzing trace with hash 143816099, now seen corresponding path program 3 times
[2020-10-16 01:40:03,658 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:03,658 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112042198]
[2020-10-16 01:40:03,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:03,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:03,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:03,942 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112042198]
[2020-10-16 01:40:03,942 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:03,942 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:40:03,943 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765183415]
[2020-10-16 01:40:03,944 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:40:03,944 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:03,944 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:40:03,945 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:40:03,948 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 185
[2020-10-16 01:40:03,949 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 97 flow. Second operand 7 states.
[2020-10-16 01:40:03,949 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:03,949 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 185
[2020-10-16 01:40:03,949 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,098 INFO  L129       PetriNetUnfolder]: 13/61 cut-off events.
[2020-10-16 01:40:04,098 INFO  L130       PetriNetUnfolder]: For 75/79 co-relation queries the response was YES.
[2020-10-16 01:40:04,099 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 170 conditions, 61 events. 13/61 cut-off events. For 75/79 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 1 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 153. Up to 22 conditions per place. 
[2020-10-16 01:40:04,099 INFO  L132   encePairwiseOnDemand]: 181/185 looper letters, 10 selfloop transitions, 5 changer transitions 0/26 dead transitions.
[2020-10-16 01:40:04,100 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 137 flow
[2020-10-16 01:40:04,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:40:04,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:40:04,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions.
[2020-10-16 01:40:04,103 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.6797297297297298
[2020-10-16 01:40:04,103 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 503 transitions.
[2020-10-16 01:40:04,103 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions.
[2020-10-16 01:40:04,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,104 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions.
[2020-10-16 01:40:04,105 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:40:04,107 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:40:04,107 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:40:04,107 INFO  L185             Difference]: Start difference. First operand has 38 places, 22 transitions, 97 flow. Second operand 4 states and 503 transitions.
[2020-10-16 01:40:04,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 137 flow
[2020-10-16 01:40:04,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 125 flow, removed 2 selfloop flow, removed 4 redundant places.
[2020-10-16 01:40:04,112 INFO  L241             Difference]: Finished difference. Result has 38 places, 23 transitions, 104 flow
[2020-10-16 01:40:04,113 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=23}
[2020-10-16 01:40:04,113 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places.
[2020-10-16 01:40:04,113 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 104 flow
[2020-10-16 01:40:04,113 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:40:04,113 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,114 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,114 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:40:04,114 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,114 INFO  L82        PathProgramCache]: Analyzing trace with hash 994001719, now seen corresponding path program 1 times
[2020-10-16 01:40:04,115 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,115 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295261253]
[2020-10-16 01:40:04,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:04,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:04,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:04,251 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295261253]
[2020-10-16 01:40:04,251 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:04,252 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:40:04,252 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382860148]
[2020-10-16 01:40:04,252 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:40:04,252 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:04,253 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:40:04,253 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:40:04,254 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185
[2020-10-16 01:40:04,255 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 104 flow. Second operand 4 states.
[2020-10-16 01:40:04,255 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:04,255 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185
[2020-10-16 01:40:04,255 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,311 INFO  L129       PetriNetUnfolder]: 42/123 cut-off events.
[2020-10-16 01:40:04,312 INFO  L130       PetriNetUnfolder]: For 86/90 co-relation queries the response was YES.
[2020-10-16 01:40:04,313 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 297 conditions, 123 events. 42/123 cut-off events. For 86/90 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 565 event pairs, 16 based on Foata normal form. 15/130 useless extension candidates. Maximal degree in co-relation 281. Up to 70 conditions per place. 
[2020-10-16 01:40:04,314 INFO  L132   encePairwiseOnDemand]: 179/185 looper letters, 8 selfloop transitions, 8 changer transitions 0/33 dead transitions.
[2020-10-16 01:40:04,314 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 156 flow
[2020-10-16 01:40:04,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:40:04,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:40:04,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions.
[2020-10-16 01:40:04,317 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8735135135135135
[2020-10-16 01:40:04,318 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 808 transitions.
[2020-10-16 01:40:04,318 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions.
[2020-10-16 01:40:04,318 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,319 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions.
[2020-10-16 01:40:04,320 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:40:04,322 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:40:04,323 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:40:04,323 INFO  L185             Difference]: Start difference. First operand has 38 places, 23 transitions, 104 flow. Second operand 5 states and 808 transitions.
[2020-10-16 01:40:04,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 156 flow
[2020-10-16 01:40:04,324 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:40:04,325 INFO  L241             Difference]: Finished difference. Result has 44 places, 30 transitions, 160 flow
[2020-10-16 01:40:04,326 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=30}
[2020-10-16 01:40:04,326 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places.
[2020-10-16 01:40:04,326 INFO  L481      AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 160 flow
[2020-10-16 01:40:04,326 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:40:04,326 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,326 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,327 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:40:04,327 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,327 INFO  L82        PathProgramCache]: Analyzing trace with hash 1014494038, now seen corresponding path program 1 times
[2020-10-16 01:40:04,327 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,328 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637397323]
[2020-10-16 01:40:04,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:04,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:04,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:04,401 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637397323]
[2020-10-16 01:40:04,401 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:04,401 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:40:04,401 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443941489]
[2020-10-16 01:40:04,402 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:40:04,402 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:04,402 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:40:04,402 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:40:04,404 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185
[2020-10-16 01:40:04,405 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 160 flow. Second operand 5 states.
[2020-10-16 01:40:04,405 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:04,405 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185
[2020-10-16 01:40:04,405 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,484 INFO  L129       PetriNetUnfolder]: 29/107 cut-off events.
[2020-10-16 01:40:04,484 INFO  L130       PetriNetUnfolder]: For 162/279 co-relation queries the response was YES.
[2020-10-16 01:40:04,485 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 396 conditions, 107 events. 29/107 cut-off events. For 162/279 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 474 event pairs, 2 based on Foata normal form. 39/141 useless extension candidates. Maximal degree in co-relation 376. Up to 66 conditions per place. 
[2020-10-16 01:40:04,486 INFO  L132   encePairwiseOnDemand]: 179/185 looper letters, 5 selfloop transitions, 15 changer transitions 3/40 dead transitions.
[2020-10-16 01:40:04,486 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 264 flow
[2020-10-16 01:40:04,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:40:04,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:40:04,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1131 transitions.
[2020-10-16 01:40:04,491 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8733590733590734
[2020-10-16 01:40:04,491 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1131 transitions.
[2020-10-16 01:40:04,491 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1131 transitions.
[2020-10-16 01:40:04,492 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,492 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1131 transitions.
[2020-10-16 01:40:04,494 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:40:04,497 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:40:04,497 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:40:04,497 INFO  L185             Difference]: Start difference. First operand has 44 places, 30 transitions, 160 flow. Second operand 7 states and 1131 transitions.
[2020-10-16 01:40:04,497 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 264 flow
[2020-10-16 01:40:04,499 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:40:04,500 INFO  L241             Difference]: Finished difference. Result has 52 places, 37 transitions, 255 flow
[2020-10-16 01:40:04,500 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=52, PETRI_TRANSITIONS=37}
[2020-10-16 01:40:04,501 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places.
[2020-10-16 01:40:04,501 INFO  L481      AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 255 flow
[2020-10-16 01:40:04,501 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:40:04,501 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,501 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,501 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:40:04,502 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,502 INFO  L82        PathProgramCache]: Analyzing trace with hash -1006414928, now seen corresponding path program 1 times
[2020-10-16 01:40:04,502 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,503 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178054931]
[2020-10-16 01:40:04,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:04,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:04,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:04,586 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178054931]
[2020-10-16 01:40:04,587 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:04,587 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:40:04,587 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640631709]
[2020-10-16 01:40:04,588 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:40:04,588 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:04,588 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:40:04,589 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:40:04,590 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185
[2020-10-16 01:40:04,591 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 255 flow. Second operand 6 states.
[2020-10-16 01:40:04,591 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:04,592 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185
[2020-10-16 01:40:04,592 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,693 INFO  L129       PetriNetUnfolder]: 21/90 cut-off events.
[2020-10-16 01:40:04,693 INFO  L130       PetriNetUnfolder]: For 335/537 co-relation queries the response was YES.
[2020-10-16 01:40:04,695 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 420 conditions, 90 events. 21/90 cut-off events. For 335/537 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 375 event pairs, 0 based on Foata normal form. 51/136 useless extension candidates. Maximal degree in co-relation 396. Up to 57 conditions per place. 
[2020-10-16 01:40:04,696 INFO  L132   encePairwiseOnDemand]: 179/185 looper letters, 2 selfloop transitions, 19 changer transitions 3/41 dead transitions.
[2020-10-16 01:40:04,697 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 41 transitions, 333 flow
[2020-10-16 01:40:04,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:40:04,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:40:04,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1448 transitions.
[2020-10-16 01:40:04,730 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8696696696696696
[2020-10-16 01:40:04,730 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1448 transitions.
[2020-10-16 01:40:04,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1448 transitions.
[2020-10-16 01:40:04,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1448 transitions.
[2020-10-16 01:40:04,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:40:04,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:40:04,736 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:40:04,736 INFO  L185             Difference]: Start difference. First operand has 52 places, 37 transitions, 255 flow. Second operand 9 states and 1448 transitions.
[2020-10-16 01:40:04,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 41 transitions, 333 flow
[2020-10-16 01:40:04,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 278 flow, removed 18 selfloop flow, removed 6 redundant places.
[2020-10-16 01:40:04,740 INFO  L241             Difference]: Finished difference. Result has 57 places, 38 transitions, 261 flow
[2020-10-16 01:40:04,740 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=57, PETRI_TRANSITIONS=38}
[2020-10-16 01:40:04,740 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places.
[2020-10-16 01:40:04,741 INFO  L481      AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 261 flow
[2020-10-16 01:40:04,741 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:40:04,741 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,741 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,741 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:40:04,741 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,742 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,742 INFO  L82        PathProgramCache]: Analyzing trace with hash -1906467213, now seen corresponding path program 1 times
[2020-10-16 01:40:04,742 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,742 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241607168]
[2020-10-16 01:40:04,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:04,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:04,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:04,783 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241607168]
[2020-10-16 01:40:04,783 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:04,783 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:40:04,783 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235786706]
[2020-10-16 01:40:04,784 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:40:04,784 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:04,784 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:40:04,784 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:40:04,786 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 185
[2020-10-16 01:40:04,786 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 261 flow. Second operand 4 states.
[2020-10-16 01:40:04,786 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:04,786 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 185
[2020-10-16 01:40:04,787 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,839 INFO  L129       PetriNetUnfolder]: 61/233 cut-off events.
[2020-10-16 01:40:04,840 INFO  L130       PetriNetUnfolder]: For 555/576 co-relation queries the response was YES.
[2020-10-16 01:40:04,842 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 893 conditions, 233 events. 61/233 cut-off events. For 555/576 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1548 event pairs, 4 based on Foata normal form. 6/225 useless extension candidates. Maximal degree in co-relation 869. Up to 70 conditions per place. 
[2020-10-16 01:40:04,843 INFO  L132   encePairwiseOnDemand]: 181/185 looper letters, 7 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2020-10-16 01:40:04,843 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 43 transitions, 296 flow
[2020-10-16 01:40:04,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:40:04,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:40:04,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 817 transitions.
[2020-10-16 01:40:04,847 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8832432432432432
[2020-10-16 01:40:04,847 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,847 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,848 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,848 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,849 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:40:04,851 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:40:04,851 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:40:04,851 INFO  L185             Difference]: Start difference. First operand has 57 places, 38 transitions, 261 flow. Second operand 5 states and 817 transitions.
[2020-10-16 01:40:04,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 43 transitions, 296 flow
[2020-10-16 01:40:04,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 236 flow, removed 13 selfloop flow, removed 8 redundant places.
[2020-10-16 01:40:04,859 INFO  L241             Difference]: Finished difference. Result has 54 places, 40 transitions, 221 flow
[2020-10-16 01:40:04,860 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=40}
[2020-10-16 01:40:04,860 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places.
[2020-10-16 01:40:04,860 INFO  L481      AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 221 flow
[2020-10-16 01:40:04,860 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:40:04,860 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,861 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,861 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:40:04,861 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,861 INFO  L82        PathProgramCache]: Analyzing trace with hash -1474321363, now seen corresponding path program 2 times
[2020-10-16 01:40:04,862 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,862 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395745029]
[2020-10-16 01:40:04,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:04,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:40:04,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:40:04,901 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395745029]
[2020-10-16 01:40:04,901 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:40:04,901 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:40:04,902 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203328277]
[2020-10-16 01:40:04,902 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:40:04,902 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:40:04,902 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:40:04,903 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:40:04,904 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 185
[2020-10-16 01:40:04,904 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 221 flow. Second operand 4 states.
[2020-10-16 01:40:04,904 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:40:04,905 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 185
[2020-10-16 01:40:04,905 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:40:04,967 INFO  L129       PetriNetUnfolder]: 84/311 cut-off events.
[2020-10-16 01:40:04,968 INFO  L130       PetriNetUnfolder]: For 363/399 co-relation queries the response was YES.
[2020-10-16 01:40:04,970 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 311 events. 84/311 cut-off events. For 363/399 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2193 event pairs, 4 based on Foata normal form. 5/289 useless extension candidates. Maximal degree in co-relation 1000. Up to 100 conditions per place. 
[2020-10-16 01:40:04,971 INFO  L132   encePairwiseOnDemand]: 181/185 looper letters, 4 selfloop transitions, 2 changer transitions 7/45 dead transitions.
[2020-10-16 01:40:04,971 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 269 flow
[2020-10-16 01:40:04,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:40:04,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:40:04,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 817 transitions.
[2020-10-16 01:40:04,975 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8832432432432432
[2020-10-16 01:40:04,975 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,975 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,975 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:40:04,976 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 817 transitions.
[2020-10-16 01:40:04,977 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:40:04,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:40:04,979 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:40:04,979 INFO  L185             Difference]: Start difference. First operand has 54 places, 40 transitions, 221 flow. Second operand 5 states and 817 transitions.
[2020-10-16 01:40:04,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 269 flow
[2020-10-16 01:40:04,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:40:04,988 INFO  L241             Difference]: Finished difference. Result has 58 places, 38 transitions, 217 flow
[2020-10-16 01:40:04,988 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=38}
[2020-10-16 01:40:04,989 INFO  L342   CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places.
[2020-10-16 01:40:04,989 INFO  L481      AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 217 flow
[2020-10-16 01:40:04,989 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:40:04,989 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:40:04,989 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:40:04,989 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:40:04,989 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:40:04,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:40:04,990 INFO  L82        PathProgramCache]: Analyzing trace with hash 113973007, now seen corresponding path program 3 times
[2020-10-16 01:40:04,990 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:40:04,990 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406029822]
[2020-10-16 01:40:04,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:40:05,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:40:05,030 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:40:05,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:40:05,084 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:40:05,129 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:40:05,129 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:40:05,129 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:40:05,130 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 01:40:05,146 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L3-->L839: Formula: (let ((.cse8 (= (mod ~y$r_buff1_thd0~0_In-2023730725 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-2023730725 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-2023730725 256) 0)) (.cse10 (= (mod ~y$w_buff0_used~0_In-2023730725 256) 0))) (let ((.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse6 (or .cse9 .cse10)) (.cse3 (or .cse8 .cse7)) (.cse4 (not .cse8)) (.cse5 (not .cse7))) (and (let ((.cse0 (select |#memory_int_In-2023730725| |~#y~0.base_In-2023730725|))) (or (and (= (store |#memory_int_In-2023730725| |~#y~0.base_In-2023730725| (store .cse0 |~#y~0.offset_In-2023730725| ~y$w_buff0~0_In-2023730725)) |#memory_int_Out-2023730725|) .cse1 .cse2) (and (or (and .cse3 (= |#memory_int_Out-2023730725| (store |#memory_int_In-2023730725| |~#y~0.base_In-2023730725| (store .cse0 |~#y~0.offset_In-2023730725| (select .cse0 |~#y~0.offset_In-2023730725|))))) (and .cse4 (= |#memory_int_Out-2023730725| (store |#memory_int_In-2023730725| |~#y~0.base_In-2023730725| (store .cse0 |~#y~0.offset_In-2023730725| ~y$w_buff1~0_In-2023730725))) .cse5)) .cse6))) (= ~y$r_buff0_thd0~0_Out-2023730725 ~y$r_buff0_thd0~0_In-2023730725) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2023730725| ULTIMATE.start_assume_abort_if_not_~cond_Out-2023730725) (or (and (= ~y$w_buff0_used~0_Out-2023730725 0) .cse1 .cse2) (and (= ~y$w_buff0_used~0_In-2023730725 ~y$w_buff0_used~0_Out-2023730725) .cse6)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2023730725 0)) (or (and (= ~y$w_buff1_used~0_Out-2023730725 ~y$w_buff1_used~0_In-2023730725) .cse3) (and .cse4 (= ~y$w_buff1_used~0_Out-2023730725 0) .cse5)) (= ~y$r_buff1_thd0~0_In-2023730725 ~y$r_buff1_thd0~0_Out-2023730725))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2023730725|, ~#y~0.offset=|~#y~0.offset_In-2023730725|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2023730725, ~y$w_buff1~0=~y$w_buff1~0_In-2023730725, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2023730725, ~y$w_buff0~0=~y$w_buff0~0_In-2023730725, #memory_int=|#memory_int_In-2023730725|, ~#y~0.base=|~#y~0.base_In-2023730725|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2023730725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2023730725}  OutVars{~#y~0.offset=|~#y~0.offset_In-2023730725|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-2023730725, ~#y~0.base=|~#y~0.base_In-2023730725|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2023730725|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2023730725|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2023730725|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2023730725|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2023730725|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2023730725|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2023730725|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2023730725, ~y$w_buff1~0=~y$w_buff1~0_In-2023730725, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-2023730725, ~y$w_buff0~0=~y$w_buff0~0_In-2023730725, #memory_int=|#memory_int_Out-2023730725|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2023730725, ULTIMATE.start_main_#t~mem39=|ULTIMATE.start_main_#t~mem39_Out-2023730725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-2023730725}  AuxVars[]  AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem39, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 01:40:05,154 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,154 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,154 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,154 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,155 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,155 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,155 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,155 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,155 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,155 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,156 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,156 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,157 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,157 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,157 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,157 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,157 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,159 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,159 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,160 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,160 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,160 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,160 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,160 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,161 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:40:05,161 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:40:05,238 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:40:05 BasicIcfg
[2020-10-16 01:40:05,238 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:40:05,240 INFO  L168              Benchmark]: Toolchain (without parser) took 12988.60 ms. Allocated memory was 250.1 MB in the beginning and 547.9 MB in the end (delta: 297.8 MB). Free memory was 205.8 MB in the beginning and 394.8 MB in the end (delta: -189.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,240 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,241 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 724.38 ms. Allocated memory was 250.1 MB in the beginning and 311.4 MB in the end (delta: 61.3 MB). Free memory was 205.8 MB in the beginning and 263.8 MB in the end (delta: -58.0 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,242 INFO  L168              Benchmark]: Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 311.4 MB. Free memory was 263.8 MB in the beginning and 261.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,243 INFO  L168              Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 311.4 MB. Free memory was 261.3 MB in the beginning and 258.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,243 INFO  L168              Benchmark]: RCFGBuilder took 1963.00 ms. Allocated memory was 311.4 MB in the beginning and 356.0 MB in the end (delta: 44.6 MB). Free memory was 258.8 MB in the beginning and 214.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,244 INFO  L168              Benchmark]: TraceAbstraction took 10190.04 ms. Allocated memory was 356.0 MB in the beginning and 547.9 MB in the end (delta: 191.9 MB). Free memory was 214.3 MB in the beginning and 394.8 MB in the end (delta: -180.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:40:05,254 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.26 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 724.38 ms. Allocated memory was 250.1 MB in the beginning and 311.4 MB in the end (delta: 61.3 MB). Free memory was 205.8 MB in the beginning and 263.8 MB in the end (delta: -58.0 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 311.4 MB. Free memory was 263.8 MB in the beginning and 261.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 40.83 ms. Allocated memory is still 311.4 MB. Free memory was 261.3 MB in the beginning and 258.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1963.00 ms. Allocated memory was 311.4 MB in the beginning and 356.0 MB in the end (delta: 44.6 MB). Free memory was 258.8 MB in the beginning and 214.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 10190.04 ms. Allocated memory was 356.0 MB in the beginning and 547.9 MB in the end (delta: 191.9 MB). Free memory was 214.3 MB in the beginning and 394.8 MB in the end (delta: -180.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    566 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.9s, 103 PlacesBefore, 29 PlacesAfterwards, 94 TransitionsBefore, 19 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 2520 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L703]               0  int __unbuffered_p0_EAX$mem_tmp;
[L704]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L705]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L706]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L707]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L708]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L709]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L710]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L711]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L712]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L713]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L714]               0  int __unbuffered_p0_EAX$w_buff0;
[L715]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L716]               0  int __unbuffered_p0_EAX$w_buff1;
[L717]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L719]               0  int __unbuffered_p0_EBX = 0;
[L721]               0  int __unbuffered_p2_EAX = 0;
[L722]               0  _Bool main$tmp_guard0;
[L723]               0  _Bool main$tmp_guard1;
[L725]               0  int x = 0;
[L727]               0  int y = 0;
[L728]               0  _Bool y$flush_delayed;
[L729]               0  int y$mem_tmp;
[L730]               0  _Bool y$r_buff0_thd0;
[L731]               0  _Bool y$r_buff0_thd1;
[L732]               0  _Bool y$r_buff0_thd2;
[L733]               0  _Bool y$r_buff0_thd3;
[L734]               0  _Bool y$r_buff1_thd0;
[L735]               0  _Bool y$r_buff1_thd1;
[L736]               0  _Bool y$r_buff1_thd2;
[L737]               0  _Bool y$r_buff1_thd3;
[L738]               0  _Bool y$read_delayed;
[L739]               0  int *y$read_delayed_var;
[L740]               0  int y$w_buff0;
[L741]               0  _Bool y$w_buff0_used;
[L742]               0  int y$w_buff1;
[L743]               0  _Bool y$w_buff1_used;
[L744]               0  _Bool weak$$choice0;
[L745]               0  _Bool weak$$choice1;
[L746]               0  _Bool weak$$choice2;
[L823]               0  pthread_t t2109;
[L824]  FCALL, FORK  0  pthread_create(&t2109, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L825]               0  pthread_t t2110;
[L826]  FCALL, FORK  0  pthread_create(&t2110, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L827]               0  pthread_t t2111;
[L828]  FCALL, FORK  0  pthread_create(&t2111, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L750]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L751]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L752]               1  y$flush_delayed = weak$$choice2
[L753]  EXPR         1  \read(y)
[L753]               1  y$mem_tmp = y
[L754]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L754]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1
[L754]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L754]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L755]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L755]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L756]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L756]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L756]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L756]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L757]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L757]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L758]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L759]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L760]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L761]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L762]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L763]  EXPR         1  \read(y)
[L763]               1  __unbuffered_p0_EAX = y
[L764]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L764]               1  y = y$flush_delayed ? y$mem_tmp : y
[L765]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L768]               1  __unbuffered_p0_EBX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L780]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L783]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L795]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L773]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L775]               1  return 0;
[L798]               3  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L801]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L801]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L802]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L802]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L803]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L803]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L804]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L804]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L805]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L805]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L788]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L790]               2  return 0;
[L808]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L810]               3  return 0;
[L830]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L841]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L842]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L842]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L843]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 50 SDtfs, 28 SDslu, 18 SDs, 0 SdLazy, 214 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 13330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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!
Received shutdown request...