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


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


This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8
[2021-03-11 20:26:42,496 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-03-11 20:26:42,497 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-11 20:26:42,534 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-11 20:26:42,535 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-11 20:26:42,537 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-11 20:26:42,539 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-11 20:26:42,544 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-11 20:26:42,545 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-11 20:26:42,549 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-11 20:26:42,550 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-03-11 20:26:42,551 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-11 20:26:42,551 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-11 20:26:42,552 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-11 20:26:42,553 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-11 20:26:42,554 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-11 20:26:42,556 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-11 20:26:42,557 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-11 20:26:42,559 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-11 20:26:42,565 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-11 20:26:42,566 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-11 20:26:42,567 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-11 20:26:42,568 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-03-11 20:26:42,569 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-11 20:26:42,570 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-11 20:26:42,570 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-11 20:26:42,571 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-11 20:26:42,572 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-11 20:26:42,572 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-11 20:26:42,572 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-11 20:26:42,573 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-11 20:26:42,573 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-11 20:26:42,574 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-11 20:26:42,575 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-11 20:26:42,575 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-11 20:26:42,575 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-11 20:26:42,576 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-11 20:26:42,576 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-11 20:26:42,576 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-11 20:26:42,576 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-11 20:26:42,577 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-03-11 20:26:42,577 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
[2021-03-11 20:26:42,603 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-03-11 20:26:42,603 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-11 20:26:42,605 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-03-11 20:26:42,606 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-03-11 20:26:42,606 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-03-11 20:26:42,607 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-03-11 20:26:42,607 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-11 20:26:42,607 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-03-11 20:26:42,607 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-03-11 20:26:42,607 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-03-11 20:26:42,608 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-11 20:26:42,608 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-03-11 20:26:42,608 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-11 20:26:42,609 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-03-11 20:26:42,609 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-11 20:26:42,609 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-11 20:26:42,609 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-03-11 20:26:42,817 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-11 20:26:42,833 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-11 20:26:42,835 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-11 20:26:42,835 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-03-11 20:26:42,836 INFO  L275        PluginConnector]: CDTParser initialized
[2021-03-11 20:26:42,836 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc.i
[2021-03-11 20:26:42,889 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1128b7f/640812650aef45a99cd1ff200208149e/FLAGaafe64f0d
[2021-03-11 20:26:43,257 INFO  L306              CDTParser]: Found 1 translation units.
[2021-03-11 20:26:43,257 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc.i
[2021-03-11 20:26:43,267 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1128b7f/640812650aef45a99cd1ff200208149e/FLAGaafe64f0d
[2021-03-11 20:26:43,634 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1128b7f/640812650aef45a99cd1ff200208149e
[2021-03-11 20:26:43,639 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-11 20:26:43,656 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-11 20:26:43,658 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-11 20:26:43,658 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-11 20:26:43,661 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-11 20:26:43,661 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:26:43" (1/1) ...
[2021-03-11 20:26:43,662 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405b403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:43, skipping insertion in model container
[2021-03-11 20:26:43,662 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:26:43" (1/1) ...
[2021-03-11 20:26:43,667 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-03-11 20:26:43,728 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-03-11 20:26:43,871 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc.i[995,1008]
[2021-03-11 20:26:43,988 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-11 20:26:43,993 INFO  L203         MainTranslator]: Completed pre-run
[2021-03-11 20:26:44,000 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc.i[995,1008]
[2021-03-11 20:26:44,034 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-11 20:26:44,080 INFO  L208         MainTranslator]: Completed translation
[2021-03-11 20:26:44,080 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44 WrapperNode
[2021-03-11 20:26:44,080 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-11 20:26:44,081 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-11 20:26:44,081 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-11 20:26:44,081 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-11 20:26:44,086 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,098 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,115 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-11 20:26:44,116 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-11 20:26:44,116 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-11 20:26:44,116 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-03-11 20:26:44,121 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,121 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,125 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,125 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,132 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,136 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,138 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (1/1) ...
[2021-03-11 20:26:44,141 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-11 20:26:44,142 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-11 20:26:44,142 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-03-11 20:26:44,142 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-03-11 20:26:44,159 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (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
[2021-03-11 20:26:44,203 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-03-11 20:26:44,204 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-03-11 20:26:44,204 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-03-11 20:26:44,204 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-03-11 20:26:44,204 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-11 20:26:44,205 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-11 20:26:44,205 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-11 20:26:44,205 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-11 20:26:44,206 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-11 20:26:46,303 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-11 20:26:46,304 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-03-11 20:26:46,305 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:26:46 BoogieIcfgContainer
[2021-03-11 20:26:46,305 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-11 20:26:46,306 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-11 20:26:46,306 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-03-11 20:26:46,308 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-03-11 20:26:46,308 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:26:43" (1/3) ...
[2021-03-11 20:26:46,309 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212927f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:26:46, skipping insertion in model container
[2021-03-11 20:26:46,309 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:44" (2/3) ...
[2021-03-11 20:26:46,309 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212927f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:26:46, skipping insertion in model container
[2021-03-11 20:26:46,309 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:26:46" (3/3) ...
[2021-03-11 20:26:46,310 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_power.oepc.i
[2021-03-11 20:26:46,314 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-11 20:26:46,317 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-03-11 20:26:46,317 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-11 20:26:46,352 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,353 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,354 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,354 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,355 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,363 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,363 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,363 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,363 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,364 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,365 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,365 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,365 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,365 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,366 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,367 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,368 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,368 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,369 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,370 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,371 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,372 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,373 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,374 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,374 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,376 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,376 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,376 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,376 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,379 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,380 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,381 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,382 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,383 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,384 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,385 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,386 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,386 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,386 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,386 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,387 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,388 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,389 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,390 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,391 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,391 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,391 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,391 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,393 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,393 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,393 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,394 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,394 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,394 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,396 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,403 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,403 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,403 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,403 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,403 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,404 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,405 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,406 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,406 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,406 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,406 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,407 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,408 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:26:46,411 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-11 20:26:46,422 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-03-11 20:26:46,444 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-03-11 20:26:46,444 INFO  L377      AbstractCegarLoop]: Hoare is false
[2021-03-11 20:26:46,444 INFO  L378      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-11 20:26:46,444 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-11 20:26:46,444 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-11 20:26:46,444 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-03-11 20:26:46,444 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-11 20:26:46,444 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-11 20:26:46,452 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow
[2021-03-11 20:26:46,488 INFO  L129       PetriNetUnfolder]: 2/96 cut-off events.
[2021-03-11 20:26:46,489 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:26:46,492 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. 
[2021-03-11 20:26:46,492 INFO  L82        GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow
[2021-03-11 20:26:46,495 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow
[2021-03-11 20:26:46,497 INFO  L118   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-11 20:26:46,503 INFO  L133   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow
[2021-03-11 20:26:46,504 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow
[2021-03-11 20:26:46,505 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow
[2021-03-11 20:26:46,527 INFO  L129       PetriNetUnfolder]: 2/96 cut-off events.
[2021-03-11 20:26:46,527 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:26:46,528 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. 
[2021-03-11 20:26:46,530 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1786
[2021-03-11 20:26:47,365 WARN  L205               SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187
[2021-03-11 20:26:47,633 WARN  L205               SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 185
[2021-03-11 20:26:48,877 WARN  L205               SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 312 DAG size of output: 268
[2021-03-11 20:26:49,413 WARN  L205               SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 265
[2021-03-11 20:26:50,703 WARN  L205               SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2021-03-11 20:26:51,101 WARN  L205               SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86
[2021-03-11 20:26:51,240 WARN  L205               SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2021-03-11 20:26:52,104 WARN  L205               SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 188
[2021-03-11 20:26:52,382 WARN  L205               SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 188
[2021-03-11 20:26:52,986 WARN  L205               SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-11 20:26:53,591 WARN  L205               SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-11 20:26:53,963 WARN  L205               SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 188
[2021-03-11 20:26:54,240 WARN  L205               SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 188
[2021-03-11 20:26:54,805 WARN  L205               SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-11 20:26:55,347 WARN  L205               SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-11 20:26:56,480 WARN  L205               SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 202
[2021-03-11 20:26:56,847 WARN  L205               SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 202
[2021-03-11 20:26:57,422 WARN  L205               SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 282
[2021-03-11 20:26:58,029 WARN  L205               SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 282
[2021-03-11 20:26:58,335 WARN  L205               SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-03-11 20:26:58,468 WARN  L205               SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-03-11 20:26:58,740 WARN  L205               SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-03-11 20:26:58,865 WARN  L205               SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-03-11 20:26:58,887 INFO  L131        LiptonReduction]: Checked pairs total: 5207
[2021-03-11 20:26:58,887 INFO  L133        LiptonReduction]: Total number of compositions: 83
[2021-03-11 20:26:58,888 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12393
[2021-03-11 20:26:58,895 INFO  L129       PetriNetUnfolder]: 0/8 cut-off events.
[2021-03-11 20:26:58,895 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:26:58,895 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:58,896 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2021-03-11 20:26:58,896 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:58,900 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:58,900 INFO  L82        PathProgramCache]: Analyzing trace with hash 1729437353, now seen corresponding path program 1 times
[2021-03-11 20:26:58,905 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:58,906 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322211924]
[2021-03-11 20:26:58,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,065 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,065 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:26:59,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:26:59,070 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322211924]
[2021-03-11 20:26:59,070 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:26:59,070 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-03-11 20:26:59,071 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553537264]
[2021-03-11 20:26:59,075 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 20:26:59,076 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:26:59,082 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 20:26:59,083 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 20:26:59,085 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 182
[2021-03-11 20:26:59,088 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand  has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,088 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:26:59,088 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 182
[2021-03-11 20:26:59,089 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:26:59,254 INFO  L129       PetriNetUnfolder]: 265/532 cut-off events.
[2021-03-11 20:26:59,254 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:26:59,256 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 952 conditions, 532 events. 265/532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3070 event pairs, 57 based on Foata normal form. 33/520 useless extension candidates. Maximal degree in co-relation 942. Up to 305 conditions per place. 
[2021-03-11 20:26:59,260 INFO  L132   encePairwiseOnDemand]: 178/182 looper letters, 15 selfloop transitions, 2 changer transitions 2/31 dead transitions.
[2021-03-11 20:26:59,260 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 109 flow
[2021-03-11 20:26:59,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-11 20:26:59,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-11 20:26:59,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions.
[2021-03-11 20:26:59,269 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.8424908424908425
[2021-03-11 20:26:59,269 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 460 transitions.
[2021-03-11 20:26:59,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions.
[2021-03-11 20:26:59,270 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:26:59,272 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions.
[2021-03-11 20:26:59,275 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,280 INFO  L185             Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 460 transitions.
[2021-03-11 20:26:59,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 109 flow
[2021-03-11 20:26:59,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-11 20:26:59,282 INFO  L241             Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow
[2021-03-11 20:26:59,284 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22}
[2021-03-11 20:26:59,284 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places.
[2021-03-11 20:26:59,284 INFO  L480      AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow
[2021-03-11 20:26:59,284 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,284 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:59,285 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:26:59,285 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-11 20:26:59,285 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:59,285 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:59,285 INFO  L82        PathProgramCache]: Analyzing trace with hash -1990435045, now seen corresponding path program 1 times
[2021-03-11 20:26:59,285 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:59,285 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748311386]
[2021-03-11 20:26:59,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,341 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,342 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:26:59,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:26:59,344 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748311386]
[2021-03-11 20:26:59,344 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:26:59,344 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-03-11 20:26:59,344 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022503773]
[2021-03-11 20:26:59,347 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 20:26:59,347 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:26:59,348 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 20:26:59,348 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 20:26:59,349 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 182
[2021-03-11 20:26:59,349 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand  has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,349 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:26:59,349 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 182
[2021-03-11 20:26:59,349 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:26:59,363 INFO  L129       PetriNetUnfolder]: 0/22 cut-off events.
[2021-03-11 20:26:59,363 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:26:59,363 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-03-11 20:26:59,363 INFO  L132   encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions.
[2021-03-11 20:26:59,364 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow
[2021-03-11 20:26:59,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-11 20:26:59,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-11 20:26:59,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions.
[2021-03-11 20:26:59,365 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.86996336996337
[2021-03-11 20:26:59,366 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 475 transitions.
[2021-03-11 20:26:59,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions.
[2021-03-11 20:26:59,366 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:26:59,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions.
[2021-03-11 20:26:59,367 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,368 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,368 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,368 INFO  L185             Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 475 transitions.
[2021-03-11 20:26:59,368 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow
[2021-03-11 20:26:59,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-11 20:26:59,369 INFO  L241             Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow
[2021-03-11 20:26:59,369 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22}
[2021-03-11 20:26:59,369 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places.
[2021-03-11 20:26:59,370 INFO  L480      AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow
[2021-03-11 20:26:59,370 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,370 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:59,370 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:26:59,370 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-11 20:26:59,370 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:59,370 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:59,370 INFO  L82        PathProgramCache]: Analyzing trace with hash -1574170667, now seen corresponding path program 1 times
[2021-03-11 20:26:59,370 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:59,371 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262134404]
[2021-03-11 20:26:59,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,433 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,433 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:26:59,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:26:59,436 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262134404]
[2021-03-11 20:26:59,436 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:26:59,436 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-03-11 20:26:59,436 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919458992]
[2021-03-11 20:26:59,436 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 20:26:59,436 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:26:59,436 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 20:26:59,437 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 20:26:59,437 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 182
[2021-03-11 20:26:59,438 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,438 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:26:59,438 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 182
[2021-03-11 20:26:59,438 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:26:59,450 INFO  L129       PetriNetUnfolder]: 0/22 cut-off events.
[2021-03-11 20:26:59,450 INFO  L130       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2021-03-11 20:26:59,450 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 39 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-03-11 20:26:59,450 INFO  L132   encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions.
[2021-03-11 20:26:59,450 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 64 flow
[2021-03-11 20:26:59,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-11 20:26:59,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-11 20:26:59,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions.
[2021-03-11 20:26:59,453 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.8754578754578755
[2021-03-11 20:26:59,453 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 478 transitions.
[2021-03-11 20:26:59,453 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions.
[2021-03-11 20:26:59,453 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:26:59,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions.
[2021-03-11 20:26:59,454 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,456 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,456 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,456 INFO  L185             Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 478 transitions.
[2021-03-11 20:26:59,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 64 flow
[2021-03-11 20:26:59,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-11 20:26:59,457 INFO  L241             Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow
[2021-03-11 20:26:59,457 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22}
[2021-03-11 20:26:59,457 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places.
[2021-03-11 20:26:59,457 INFO  L480      AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow
[2021-03-11 20:26:59,458 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,458 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:59,458 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:26:59,458 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-11 20:26:59,458 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:59,458 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:59,458 INFO  L82        PathProgramCache]: Analyzing trace with hash 195434308, now seen corresponding path program 1 times
[2021-03-11 20:26:59,458 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:59,458 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926513286]
[2021-03-11 20:26:59,458 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,540 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,541 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:26:59,543 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,543 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:26:59,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:26:59,546 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926513286]
[2021-03-11 20:26:59,546 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:26:59,547 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-11 20:26:59,547 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977616909]
[2021-03-11 20:26:59,547 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 20:26:59,547 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:26:59,547 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 20:26:59,547 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 20:26:59,548 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182
[2021-03-11 20:26:59,548 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand  has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,549 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:26:59,549 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182
[2021-03-11 20:26:59,549 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:26:59,567 INFO  L129       PetriNetUnfolder]: 0/29 cut-off events.
[2021-03-11 20:26:59,567 INFO  L130       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2021-03-11 20:26:59,567 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 0/29 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. 
[2021-03-11 20:26:59,567 INFO  L132   encePairwiseOnDemand]: 178/182 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions.
[2021-03-11 20:26:59,567 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 75 flow
[2021-03-11 20:26:59,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-03-11 20:26:59,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2021-03-11 20:26:59,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions.
[2021-03-11 20:26:59,569 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.8392857142857143
[2021-03-11 20:26:59,569 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 611 transitions.
[2021-03-11 20:26:59,569 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions.
[2021-03-11 20:26:59,570 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:26:59,570 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions.
[2021-03-11 20:26:59,571 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,572 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,572 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,572 INFO  L185             Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 4 states and 611 transitions.
[2021-03-11 20:26:59,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 75 flow
[2021-03-11 20:26:59,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 71 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-11 20:26:59,573 INFO  L241             Difference]: Finished difference. Result has 36 places, 22 transitions, 72 flow
[2021-03-11 20:26:59,573 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=72, PETRI_PLACES=36, PETRI_TRANSITIONS=22}
[2021-03-11 20:26:59,573 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places.
[2021-03-11 20:26:59,573 INFO  L480      AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 72 flow
[2021-03-11 20:26:59,574 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,574 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:59,574 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:26:59,574 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-11 20:26:59,574 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:59,574 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:59,574 INFO  L82        PathProgramCache]: Analyzing trace with hash 6063943, now seen corresponding path program 1 times
[2021-03-11 20:26:59,574 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:59,574 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204253944]
[2021-03-11 20:26:59,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,664 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,664 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:26:59,668 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,669 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:26:59,677 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,677 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-03-11 20:26:59,692 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,693 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-03-11 20:26:59,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:26:59,694 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204253944]
[2021-03-11 20:26:59,694 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:26:59,694 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-11 20:26:59,694 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204029269]
[2021-03-11 20:26:59,694 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:26:59,694 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:26:59,694 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:26:59,694 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:26:59,695 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182
[2021-03-11 20:26:59,696 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 72 flow. Second operand  has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,696 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:26:59,696 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182
[2021-03-11 20:26:59,696 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:26:59,839 INFO  L129       PetriNetUnfolder]: 142/303 cut-off events.
[2021-03-11 20:26:59,839 INFO  L130       PetriNetUnfolder]: For 159/160 co-relation queries the response was YES.
[2021-03-11 20:26:59,840 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 665 conditions, 303 events. 142/303 cut-off events. For 159/160 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1436 event pairs, 36 based on Foata normal form. 7/300 useless extension candidates. Maximal degree in co-relation 652. Up to 201 conditions per place. 
[2021-03-11 20:26:59,842 INFO  L132   encePairwiseOnDemand]: 173/182 looper letters, 14 selfloop transitions, 10 changer transitions 0/35 dead transitions.
[2021-03-11 20:26:59,842 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 147 flow
[2021-03-11 20:26:59,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 20:26:59,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:26:59,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions.
[2021-03-11 20:26:59,844 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6987179487179487
[2021-03-11 20:26:59,845 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 763 transitions.
[2021-03-11 20:26:59,845 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions.
[2021-03-11 20:26:59,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:26:59,845 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions.
[2021-03-11 20:26:59,846 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,848 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,848 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,848 INFO  L185             Difference]: Start difference. First operand has 36 places, 22 transitions, 72 flow. Second operand 6 states and 763 transitions.
[2021-03-11 20:26:59,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 147 flow
[2021-03-11 20:26:59,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 135 flow, removed 2 selfloop flow, removed 4 redundant places.
[2021-03-11 20:26:59,851 INFO  L241             Difference]: Finished difference. Result has 39 places, 30 transitions, 125 flow
[2021-03-11 20:26:59,851 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2021-03-11 20:26:59,851 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places.
[2021-03-11 20:26:59,851 INFO  L480      AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 125 flow
[2021-03-11 20:26:59,852 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:26:59,852 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:26:59,852 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:26:59,852 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-11 20:26:59,852 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:26:59,852 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:26:59,852 INFO  L82        PathProgramCache]: Analyzing trace with hash 725221901, now seen corresponding path program 2 times
[2021-03-11 20:26:59,853 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:26:59,855 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477174786]
[2021-03-11 20:26:59,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:26:59,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:26:59,951 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,952 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:26:59,959 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,959 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:26:59,968 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,972 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-03-11 20:26:59,989 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:26:59,990 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24
[2021-03-11 20:27:00,008 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,009 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:00,025 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,026 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-03-11 20:27:00,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:00,046 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477174786]
[2021-03-11 20:27:00,046 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:00,046 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:27:00,047 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460274538]
[2021-03-11 20:27:00,047 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 20:27:00,047 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:00,047 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 20:27:00,047 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-03-11 20:27:00,048 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182
[2021-03-11 20:27:00,049 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 125 flow. Second operand  has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,049 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:00,049 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182
[2021-03-11 20:27:00,049 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:00,226 INFO  L129       PetriNetUnfolder]: 174/343 cut-off events.
[2021-03-11 20:27:00,226 INFO  L130       PetriNetUnfolder]: For 225/265 co-relation queries the response was YES.
[2021-03-11 20:27:00,227 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 984 conditions, 343 events. 174/343 cut-off events. For 225/265 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1560 event pairs, 24 based on Foata normal form. 12/348 useless extension candidates. Maximal degree in co-relation 971. Up to 233 conditions per place. 
[2021-03-11 20:27:00,228 INFO  L132   encePairwiseOnDemand]: 171/182 looper letters, 18 selfloop transitions, 24 changer transitions 0/53 dead transitions.
[2021-03-11 20:27:00,229 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 305 flow
[2021-03-11 20:27:00,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 20:27:00,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:27:00,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions.
[2021-03-11 20:27:00,231 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.7009419152276295
[2021-03-11 20:27:00,231 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 893 transitions.
[2021-03-11 20:27:00,231 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions.
[2021-03-11 20:27:00,232 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:00,232 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions.
[2021-03-11 20:27:00,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,234 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,235 INFO  L185             Difference]: Start difference. First operand has 39 places, 30 transitions, 125 flow. Second operand 7 states and 893 transitions.
[2021-03-11 20:27:00,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 305 flow
[2021-03-11 20:27:00,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-11 20:27:00,238 INFO  L241             Difference]: Finished difference. Result has 47 places, 49 transitions, 321 flow
[2021-03-11 20:27:00,238 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=47, PETRI_TRANSITIONS=49}
[2021-03-11 20:27:00,238 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places.
[2021-03-11 20:27:00,238 INFO  L480      AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 321 flow
[2021-03-11 20:27:00,239 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,239 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:00,239 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:00,239 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-11 20:27:00,239 INFO  L428      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:00,239 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:00,239 INFO  L82        PathProgramCache]: Analyzing trace with hash -1013192847, now seen corresponding path program 1 times
[2021-03-11 20:27:00,239 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:00,239 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376084340]
[2021-03-11 20:27:00,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:00,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:00,325 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,325 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:00,328 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,328 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:00,333 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,333 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:27:00,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:00,333 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376084340]
[2021-03-11 20:27:00,334 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:00,334 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-11 20:27:00,334 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117629957]
[2021-03-11 20:27:00,334 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 20:27:00,334 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:00,335 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 20:27:00,335 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 20:27:00,335 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182
[2021-03-11 20:27:00,336 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 321 flow. Second operand  has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,336 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:00,336 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182
[2021-03-11 20:27:00,336 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:00,409 INFO  L129       PetriNetUnfolder]: 179/404 cut-off events.
[2021-03-11 20:27:00,409 INFO  L130       PetriNetUnfolder]: For 486/651 co-relation queries the response was YES.
[2021-03-11 20:27:00,410 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 404 events. 179/404 cut-off events. For 486/651 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2194 event pairs, 52 based on Foata normal form. 98/475 useless extension candidates. Maximal degree in co-relation 1213. Up to 164 conditions per place. 
[2021-03-11 20:27:00,412 INFO  L132   encePairwiseOnDemand]: 176/182 looper letters, 9 selfloop transitions, 8 changer transitions 0/59 dead transitions.
[2021-03-11 20:27:00,412 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 375 flow
[2021-03-11 20:27:00,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-11 20:27:00,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-11 20:27:00,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions.
[2021-03-11 20:27:00,414 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.810989010989011
[2021-03-11 20:27:00,414 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 738 transitions.
[2021-03-11 20:27:00,414 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions.
[2021-03-11 20:27:00,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:00,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions.
[2021-03-11 20:27:00,415 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,416 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,416 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,416 INFO  L185             Difference]: Start difference. First operand has 47 places, 49 transitions, 321 flow. Second operand 5 states and 738 transitions.
[2021-03-11 20:27:00,416 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 375 flow
[2021-03-11 20:27:00,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-11 20:27:00,420 INFO  L241             Difference]: Finished difference. Result has 53 places, 56 transitions, 384 flow
[2021-03-11 20:27:00,421 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=53, PETRI_TRANSITIONS=56}
[2021-03-11 20:27:00,421 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places.
[2021-03-11 20:27:00,421 INFO  L480      AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 384 flow
[2021-03-11 20:27:00,421 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,421 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:00,421 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:00,421 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-11 20:27:00,421 INFO  L428      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:00,422 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:00,422 INFO  L82        PathProgramCache]: Analyzing trace with hash 2060204168, now seen corresponding path program 1 times
[2021-03-11 20:27:00,422 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:00,422 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135345469]
[2021-03-11 20:27:00,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:00,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:00,535 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,536 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:00,552 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:00,553 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26
[2021-03-11 20:27:00,577 INFO  L142       QuantifierPusher]: treesize reduction 33, result has 54.8 percent of original size
[2021-03-11 20:27:00,578 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size 32
[2021-03-11 20:27:00,598 INFO  L142       QuantifierPusher]: treesize reduction 33, result has 58.2 percent of original size
[2021-03-11 20:27:00,600 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 82.6 percent of original size 38
[2021-03-11 20:27:00,625 INFO  L142       QuantifierPusher]: treesize reduction 33, result has 58.2 percent of original size
[2021-03-11 20:27:00,628 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 82.6 percent of original size 38
[2021-03-11 20:27:00,630 INFO  L142       QuantifierPusher]: treesize reduction 33, result has 58.2 percent of original size
[2021-03-11 20:27:00,633 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 82.6 percent of original size 38
[2021-03-11 20:27:00,639 INFO  L142       QuantifierPusher]: treesize reduction 58, result has 69.6 percent of original size
[2021-03-11 20:27:00,642 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133
[2021-03-11 20:27:00,711 INFO  L142       QuantifierPusher]: treesize reduction 17, result has 67.9 percent of original size
[2021-03-11 20:27:00,712 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36
[2021-03-11 20:27:00,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:00,735 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135345469]
[2021-03-11 20:27:00,735 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:00,735 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:27:00,735 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815426664]
[2021-03-11 20:27:00,735 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 20:27:00,735 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:00,735 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 20:27:00,735 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-03-11 20:27:00,736 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182
[2021-03-11 20:27:00,737 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 384 flow. Second operand  has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:00,737 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:00,737 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182
[2021-03-11 20:27:00,737 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:01,050 INFO  L129       PetriNetUnfolder]: 271/568 cut-off events.
[2021-03-11 20:27:01,051 INFO  L130       PetriNetUnfolder]: For 1409/1756 co-relation queries the response was YES.
[2021-03-11 20:27:01,052 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 568 events. 271/568 cut-off events. For 1409/1756 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3280 event pairs, 66 based on Foata normal form. 100/629 useless extension candidates. Maximal degree in co-relation 2258. Up to 237 conditions per place. 
[2021-03-11 20:27:01,054 INFO  L132   encePairwiseOnDemand]: 174/182 looper letters, 23 selfloop transitions, 23 changer transitions 0/64 dead transitions.
[2021-03-11 20:27:01,054 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 531 flow
[2021-03-11 20:27:01,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 20:27:01,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:27:01,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions.
[2021-03-11 20:27:01,056 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6721611721611722
[2021-03-11 20:27:01,056 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 734 transitions.
[2021-03-11 20:27:01,056 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions.
[2021-03-11 20:27:01,057 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:01,057 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions.
[2021-03-11 20:27:01,058 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,059 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,059 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,059 INFO  L185             Difference]: Start difference. First operand has 53 places, 56 transitions, 384 flow. Second operand 6 states and 734 transitions.
[2021-03-11 20:27:01,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 531 flow
[2021-03-11 20:27:01,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-11 20:27:01,064 INFO  L241             Difference]: Finished difference. Result has 59 places, 60 transitions, 504 flow
[2021-03-11 20:27:01,064 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=59, PETRI_TRANSITIONS=60}
[2021-03-11 20:27:01,064 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places.
[2021-03-11 20:27:01,064 INFO  L480      AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 504 flow
[2021-03-11 20:27:01,064 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,065 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:01,065 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:01,065 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-11 20:27:01,065 INFO  L428      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:01,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:01,065 INFO  L82        PathProgramCache]: Analyzing trace with hash -733875080, now seen corresponding path program 1 times
[2021-03-11 20:27:01,065 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:01,065 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044879207]
[2021-03-11 20:27:01,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:01,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:01,124 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,125 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:01,127 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,127 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:01,131 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,131 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:01,136 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,137 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:27:01,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:01,138 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044879207]
[2021-03-11 20:27:01,138 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:01,138 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:27:01,138 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039303654]
[2021-03-11 20:27:01,138 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:27:01,138 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:01,138 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:27:01,138 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:27:01,139 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182
[2021-03-11 20:27:01,139 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 504 flow. Second operand  has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,139 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:01,139 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182
[2021-03-11 20:27:01,140 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:01,213 INFO  L129       PetriNetUnfolder]: 128/362 cut-off events.
[2021-03-11 20:27:01,213 INFO  L130       PetriNetUnfolder]: For 1488/2406 co-relation queries the response was YES.
[2021-03-11 20:27:01,214 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 362 events. 128/362 cut-off events. For 1488/2406 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2239 event pairs, 15 based on Foata normal form. 284/626 useless extension candidates. Maximal degree in co-relation 1501. Up to 172 conditions per place. 
[2021-03-11 20:27:01,223 INFO  L132   encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 15 changer transitions 5/67 dead transitions.
[2021-03-11 20:27:01,223 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 574 flow
[2021-03-11 20:27:01,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 20:27:01,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:27:01,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions.
[2021-03-11 20:27:01,226 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.8108320251177394
[2021-03-11 20:27:01,226 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions.
[2021-03-11 20:27:01,226 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions.
[2021-03-11 20:27:01,226 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:01,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions.
[2021-03-11 20:27:01,230 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,231 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,232 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,232 INFO  L185             Difference]: Start difference. First operand has 59 places, 60 transitions, 504 flow. Second operand 7 states and 1033 transitions.
[2021-03-11 20:27:01,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 574 flow
[2021-03-11 20:27:01,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 565 flow, removed 1 selfloop flow, removed 3 redundant places.
[2021-03-11 20:27:01,236 INFO  L241             Difference]: Finished difference. Result has 65 places, 62 transitions, 540 flow
[2021-03-11 20:27:01,236 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=65, PETRI_TRANSITIONS=62}
[2021-03-11 20:27:01,237 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places.
[2021-03-11 20:27:01,237 INFO  L480      AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 540 flow
[2021-03-11 20:27:01,237 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,237 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:01,237 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:01,237 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-11 20:27:01,237 INFO  L428      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:01,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:01,237 INFO  L82        PathProgramCache]: Analyzing trace with hash 1603276230, now seen corresponding path program 1 times
[2021-03-11 20:27:01,237 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:01,238 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255695172]
[2021-03-11 20:27:01,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:01,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:01,307 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,307 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:01,309 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,310 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:01,312 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,313 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:01,316 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,316 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:01,321 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,321 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:27:01,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:01,322 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255695172]
[2021-03-11 20:27:01,322 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:01,322 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:01,322 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120655366]
[2021-03-11 20:27:01,322 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 20:27:01,322 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:01,323 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 20:27:01,323 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-11 20:27:01,324 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182
[2021-03-11 20:27:01,324 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 540 flow. Second operand  has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,324 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:01,324 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182
[2021-03-11 20:27:01,324 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:01,408 INFO  L129       PetriNetUnfolder]: 101/306 cut-off events.
[2021-03-11 20:27:01,408 INFO  L130       PetriNetUnfolder]: For 2314/3934 co-relation queries the response was YES.
[2021-03-11 20:27:01,409 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 306 events. 101/306 cut-off events. For 2314/3934 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1868 event pairs, 5 based on Foata normal form. 243/534 useless extension candidates. Maximal degree in co-relation 1512. Up to 153 conditions per place. 
[2021-03-11 20:27:01,410 INFO  L132   encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 19 changer transitions 3/66 dead transitions.
[2021-03-11 20:27:01,410 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 618 flow
[2021-03-11 20:27:01,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-03-11 20:27:01,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 20:27:01,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1322 transitions.
[2021-03-11 20:27:01,413 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.8070818070818071
[2021-03-11 20:27:01,413 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1322 transitions.
[2021-03-11 20:27:01,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1322 transitions.
[2021-03-11 20:27:01,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:01,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1322 transitions.
[2021-03-11 20:27:01,415 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 146.88888888888889) internal successors, (1322), 9 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,417 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,418 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,418 INFO  L185             Difference]: Start difference. First operand has 65 places, 62 transitions, 540 flow. Second operand 9 states and 1322 transitions.
[2021-03-11 20:27:01,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 618 flow
[2021-03-11 20:27:01,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 568 flow, removed 17 selfloop flow, removed 4 redundant places.
[2021-03-11 20:27:01,424 INFO  L241             Difference]: Finished difference. Result has 72 places, 63 transitions, 551 flow
[2021-03-11 20:27:01,424 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=72, PETRI_TRANSITIONS=63}
[2021-03-11 20:27:01,424 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places.
[2021-03-11 20:27:01,424 INFO  L480      AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 551 flow
[2021-03-11 20:27:01,425 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,425 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:01,425 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:01,425 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-11 20:27:01,425 INFO  L428      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:01,425 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:01,425 INFO  L82        PathProgramCache]: Analyzing trace with hash 2114340851, now seen corresponding path program 1 times
[2021-03-11 20:27:01,425 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:01,425 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164090757]
[2021-03-11 20:27:01,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:01,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:01,534 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,535 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:27:01,542 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size
[2021-03-11 20:27:01,543 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44
[2021-03-11 20:27:01,546 INFO  L142       QuantifierPusher]: treesize reduction 8, result has 61.9 percent of original size
[2021-03-11 20:27:01,546 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:27:01,548 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,549 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:01,559 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,559 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:01,561 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:01,561 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:01,568 INFO  L142       QuantifierPusher]: treesize reduction 36, result has 87.5 percent of original size
[2021-03-11 20:27:01,571 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 253
[2021-03-11 20:27:01,642 INFO  L142       QuantifierPusher]: treesize reduction 49, result has 38.8 percent of original size
[2021-03-11 20:27:01,642 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-03-11 20:27:01,667 INFO  L142       QuantifierPusher]: treesize reduction 41, result has 64.0 percent of original size
[2021-03-11 20:27:01,669 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73
[2021-03-11 20:27:01,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:01,703 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164090757]
[2021-03-11 20:27:01,703 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:01,703 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:01,704 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33390133]
[2021-03-11 20:27:01,704 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:27:01,704 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:01,704 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:27:01,704 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:27:01,705 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182
[2021-03-11 20:27:01,705 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 551 flow. Second operand  has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,705 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:01,705 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182
[2021-03-11 20:27:01,706 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:01,940 INFO  L129       PetriNetUnfolder]: 134/427 cut-off events.
[2021-03-11 20:27:01,940 INFO  L130       PetriNetUnfolder]: For 2812/3199 co-relation queries the response was YES.
[2021-03-11 20:27:01,942 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 427 events. 134/427 cut-off events. For 2812/3199 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3055 event pairs, 0 based on Foata normal form. 73/483 useless extension candidates. Maximal degree in co-relation 1984. Up to 109 conditions per place. 
[2021-03-11 20:27:01,943 INFO  L132   encePairwiseOnDemand]: 173/182 looper letters, 28 selfloop transitions, 18 changer transitions 1/73 dead transitions.
[2021-03-11 20:27:01,944 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 745 flow
[2021-03-11 20:27:01,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 20:27:01,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:27:01,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions.
[2021-03-11 20:27:01,946 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6822344322344323
[2021-03-11 20:27:01,946 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 745 transitions.
[2021-03-11 20:27:01,946 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions.
[2021-03-11 20:27:01,946 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:01,946 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions.
[2021-03-11 20:27:01,947 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,949 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,949 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,949 INFO  L185             Difference]: Start difference. First operand has 72 places, 63 transitions, 551 flow. Second operand 6 states and 745 transitions.
[2021-03-11 20:27:01,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 745 flow
[2021-03-11 20:27:01,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 681 flow, removed 15 selfloop flow, removed 8 redundant places.
[2021-03-11 20:27:01,958 INFO  L241             Difference]: Finished difference. Result has 70 places, 70 transitions, 642 flow
[2021-03-11 20:27:01,958 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=70, PETRI_TRANSITIONS=70}
[2021-03-11 20:27:01,959 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places.
[2021-03-11 20:27:01,959 INFO  L480      AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 642 flow
[2021-03-11 20:27:01,959 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:01,959 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:01,959 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:01,959 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-03-11 20:27:01,959 INFO  L428      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:01,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:01,960 INFO  L82        PathProgramCache]: Analyzing trace with hash -1874567707, now seen corresponding path program 2 times
[2021-03-11 20:27:01,960 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:01,960 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55786089]
[2021-03-11 20:27:01,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:01,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:02,031 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,032 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:27:02,038 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,038 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 20:27:02,047 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size
[2021-03-11 20:27:02,047 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47
[2021-03-11 20:27:02,066 INFO  L142       QuantifierPusher]: treesize reduction 101, result has 45.4 percent of original size
[2021-03-11 20:27:02,067 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84
[2021-03-11 20:27:02,096 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,096 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12
[2021-03-11 20:27:02,106 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,106 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-11 20:27:02,117 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,118 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8
[2021-03-11 20:27:02,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:02,126 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55786089]
[2021-03-11 20:27:02,126 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:02,126 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 20:27:02,126 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466368066]
[2021-03-11 20:27:02,126 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-03-11 20:27:02,126 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:02,126 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-03-11 20:27:02,126 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2021-03-11 20:27:02,127 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182
[2021-03-11 20:27:02,128 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 642 flow. Second operand  has 9 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,128 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:02,128 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182
[2021-03-11 20:27:02,129 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:02,406 INFO  L129       PetriNetUnfolder]: 171/554 cut-off events.
[2021-03-11 20:27:02,407 INFO  L130       PetriNetUnfolder]: For 2448/2833 co-relation queries the response was YES.
[2021-03-11 20:27:02,409 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 554 events. 171/554 cut-off events. For 2448/2833 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4327 event pairs, 4 based on Foata normal form. 122/654 useless extension candidates. Maximal degree in co-relation 2396. Up to 145 conditions per place. 
[2021-03-11 20:27:02,410 INFO  L132   encePairwiseOnDemand]: 173/182 looper letters, 38 selfloop transitions, 24 changer transitions 9/97 dead transitions.
[2021-03-11 20:27:02,410 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 1073 flow
[2021-03-11 20:27:02,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 20:27:02,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:27:02,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 996 transitions.
[2021-03-11 20:27:02,413 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6840659340659341
[2021-03-11 20:27:02,413 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 996 transitions.
[2021-03-11 20:27:02,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 996 transitions.
[2021-03-11 20:27:02,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:02,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 996 transitions.
[2021-03-11 20:27:02,415 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 124.5) internal successors, (996), 8 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,416 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,417 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,417 INFO  L185             Difference]: Start difference. First operand has 70 places, 70 transitions, 642 flow. Second operand 8 states and 996 transitions.
[2021-03-11 20:27:02,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 1073 flow
[2021-03-11 20:27:02,424 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 1065 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-11 20:27:02,425 INFO  L241             Difference]: Finished difference. Result has 77 places, 81 transitions, 866 flow
[2021-03-11 20:27:02,425 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=77, PETRI_TRANSITIONS=81}
[2021-03-11 20:27:02,425 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places.
[2021-03-11 20:27:02,426 INFO  L480      AbstractCegarLoop]: Abstraction has has 77 places, 81 transitions, 866 flow
[2021-03-11 20:27:02,426 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,426 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:02,426 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:02,426 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-03-11 20:27:02,426 INFO  L428      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:02,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:02,426 INFO  L82        PathProgramCache]: Analyzing trace with hash 56076551, now seen corresponding path program 3 times
[2021-03-11 20:27:02,427 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:02,427 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008888191]
[2021-03-11 20:27:02,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:02,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:02,510 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,511 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:27:02,517 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size
[2021-03-11 20:27:02,517 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41
[2021-03-11 20:27:02,527 INFO  L142       QuantifierPusher]: treesize reduction 11, result has 72.5 percent of original size
[2021-03-11 20:27:02,527 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29
[2021-03-11 20:27:02,547 INFO  L142       QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size
[2021-03-11 20:27:02,548 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45
[2021-03-11 20:27:02,575 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size
[2021-03-11 20:27:02,575 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-11 20:27:02,587 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size
[2021-03-11 20:27:02,587 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8
[2021-03-11 20:27:02,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:02,596 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008888191]
[2021-03-11 20:27:02,596 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:02,596 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:27:02,596 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145848690]
[2021-03-11 20:27:02,596 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 20:27:02,596 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:02,597 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 20:27:02,597 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-03-11 20:27:02,598 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182
[2021-03-11 20:27:02,599 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 81 transitions, 866 flow. Second operand  has 8 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,599 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:02,599 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182
[2021-03-11 20:27:02,599 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:02,823 INFO  L129       PetriNetUnfolder]: 182/599 cut-off events.
[2021-03-11 20:27:02,824 INFO  L130       PetriNetUnfolder]: For 3164/3819 co-relation queries the response was YES.
[2021-03-11 20:27:02,826 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 599 events. 182/599 cut-off events. For 3164/3819 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4755 event pairs, 10 based on Foata normal form. 113/680 useless extension candidates. Maximal degree in co-relation 2719. Up to 165 conditions per place. 
[2021-03-11 20:27:02,828 INFO  L132   encePairwiseOnDemand]: 175/182 looper letters, 49 selfloop transitions, 14 changer transitions 13/102 dead transitions.
[2021-03-11 20:27:02,828 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 1305 flow
[2021-03-11 20:27:02,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-03-11 20:27:02,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 20:27:02,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1111 transitions.
[2021-03-11 20:27:02,830 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6782661782661783
[2021-03-11 20:27:02,830 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1111 transitions.
[2021-03-11 20:27:02,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1111 transitions.
[2021-03-11 20:27:02,831 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:02,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1111 transitions.
[2021-03-11 20:27:02,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 123.44444444444444) internal successors, (1111), 9 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,834 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,834 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,834 INFO  L185             Difference]: Start difference. First operand has 77 places, 81 transitions, 866 flow. Second operand 9 states and 1111 transitions.
[2021-03-11 20:27:02,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 1305 flow
[2021-03-11 20:27:02,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 102 transitions, 1249 flow, removed 5 selfloop flow, removed 4 redundant places.
[2021-03-11 20:27:02,845 INFO  L241             Difference]: Finished difference. Result has 85 places, 82 transitions, 925 flow
[2021-03-11 20:27:02,845 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=925, PETRI_PLACES=85, PETRI_TRANSITIONS=82}
[2021-03-11 20:27:02,845 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places.
[2021-03-11 20:27:02,845 INFO  L480      AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 925 flow
[2021-03-11 20:27:02,846 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:02,846 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:02,846 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:02,846 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-03-11 20:27:02,846 INFO  L428      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:02,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:02,846 INFO  L82        PathProgramCache]: Analyzing trace with hash 1621494019, now seen corresponding path program 4 times
[2021-03-11 20:27:02,846 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:02,846 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971386245]
[2021-03-11 20:27:02,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:02,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:02,930 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:02,931 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:27:02,940 INFO  L142       QuantifierPusher]: treesize reduction 51, result has 44.0 percent of original size
[2021-03-11 20:27:02,941 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size 32
[2021-03-11 20:27:02,945 INFO  L142       QuantifierPusher]: treesize reduction 57, result has 55.8 percent of original size
[2021-03-11 20:27:02,945 INFO  L147       QuantifierPusher]: treesize reduction 9, result has 87.5 percent of original size 63
[2021-03-11 20:27:02,992 INFO  L142       QuantifierPusher]: treesize reduction 57, result has 73.6 percent of original size
[2021-03-11 20:27:02,995 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 159
[2021-03-11 20:27:03,093 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size
[2021-03-11 20:27:03,094 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27
[2021-03-11 20:27:03,113 INFO  L142       QuantifierPusher]: treesize reduction 48, result has 57.1 percent of original size
[2021-03-11 20:27:03,113 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64
[2021-03-11 20:27:03,147 INFO  L142       QuantifierPusher]: treesize reduction 30, result has 52.4 percent of original size
[2021-03-11 20:27:03,147 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33
[2021-03-11 20:27:03,177 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:03,178 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-03-11 20:27:03,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:03,210 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971386245]
[2021-03-11 20:27:03,210 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:03,210 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 20:27:03,211 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353001986]
[2021-03-11 20:27:03,211 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-03-11 20:27:03,211 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:03,211 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-03-11 20:27:03,211 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2021-03-11 20:27:03,212 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 182
[2021-03-11 20:27:03,213 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 925 flow. Second operand  has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:03,213 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:03,213 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 182
[2021-03-11 20:27:03,213 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:03,782 INFO  L129       PetriNetUnfolder]: 173/566 cut-off events.
[2021-03-11 20:27:03,782 INFO  L130       PetriNetUnfolder]: For 3130/3754 co-relation queries the response was YES.
[2021-03-11 20:27:03,785 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 566 events. 173/566 cut-off events. For 3130/3754 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 4479 event pairs, 4 based on Foata normal form. 149/689 useless extension candidates. Maximal degree in co-relation 2632. Up to 150 conditions per place. 
[2021-03-11 20:27:03,786 INFO  L132   encePairwiseOnDemand]: 175/182 looper letters, 33 selfloop transitions, 33 changer transitions 23/115 dead transitions.
[2021-03-11 20:27:03,787 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1517 flow
[2021-03-11 20:27:03,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 20:27:03,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:27:03,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 933 transitions.
[2021-03-11 20:27:03,789 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6407967032967034
[2021-03-11 20:27:03,789 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 933 transitions.
[2021-03-11 20:27:03,789 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 933 transitions.
[2021-03-11 20:27:03,790 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:03,790 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 933 transitions.
[2021-03-11 20:27:03,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:03,792 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:03,793 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:03,793 INFO  L185             Difference]: Start difference. First operand has 85 places, 82 transitions, 925 flow. Second operand 8 states and 933 transitions.
[2021-03-11 20:27:03,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1517 flow
[2021-03-11 20:27:03,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 1450 flow, removed 11 selfloop flow, removed 7 redundant places.
[2021-03-11 20:27:03,806 INFO  L241             Difference]: Finished difference. Result has 83 places, 85 transitions, 1031 flow
[2021-03-11 20:27:03,806 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1031, PETRI_PLACES=83, PETRI_TRANSITIONS=85}
[2021-03-11 20:27:03,806 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places.
[2021-03-11 20:27:03,806 INFO  L480      AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 1031 flow
[2021-03-11 20:27:03,815 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:03,816 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:03,816 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:03,816 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-03-11 20:27:03,816 INFO  L428      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:03,816 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:03,816 INFO  L82        PathProgramCache]: Analyzing trace with hash 337524401, now seen corresponding path program 5 times
[2021-03-11 20:27:03,816 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:03,816 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945868113]
[2021-03-11 20:27:03,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:03,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:03,888 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:03,889 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:27:03,896 INFO  L142       QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size
[2021-03-11 20:27:03,896 INFO  L147       QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37
[2021-03-11 20:27:03,918 INFO  L142       QuantifierPusher]: treesize reduction 17, result has 75.4 percent of original size
[2021-03-11 20:27:03,919 INFO  L147       QuantifierPusher]: treesize reduction 9, result has 82.7 percent of original size 43
[2021-03-11 20:27:03,948 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:03,948 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-03-11 20:27:03,977 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size
[2021-03-11 20:27:03,977 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-11 20:27:03,989 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size
[2021-03-11 20:27:03,990 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8
[2021-03-11 20:27:03,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:03,999 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945868113]
[2021-03-11 20:27:03,999 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:03,999 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:27:03,999 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905198887]
[2021-03-11 20:27:04,000 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 20:27:04,000 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:04,001 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 20:27:04,001 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2021-03-11 20:27:04,002 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 182
[2021-03-11 20:27:04,003 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 1031 flow. Second operand  has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,003 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:04,003 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 182
[2021-03-11 20:27:04,003 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:04,260 INFO  L129       PetriNetUnfolder]: 157/543 cut-off events.
[2021-03-11 20:27:04,260 INFO  L130       PetriNetUnfolder]: For 2968/3428 co-relation queries the response was YES.
[2021-03-11 20:27:04,262 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 543 events. 157/543 cut-off events. For 2968/3428 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4276 event pairs, 4 based on Foata normal form. 116/636 useless extension candidates. Maximal degree in co-relation 2516. Up to 155 conditions per place. 
[2021-03-11 20:27:04,263 INFO  L132   encePairwiseOnDemand]: 175/182 looper letters, 31 selfloop transitions, 29 changer transitions 11/97 dead transitions.
[2021-03-11 20:27:04,264 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 97 transitions, 1338 flow
[2021-03-11 20:27:04,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 20:27:04,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:27:04,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 963 transitions.
[2021-03-11 20:27:04,266 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6614010989010989
[2021-03-11 20:27:04,266 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 963 transitions.
[2021-03-11 20:27:04,266 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 963 transitions.
[2021-03-11 20:27:04,266 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:04,267 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 963 transitions.
[2021-03-11 20:27:04,268 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,269 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,269 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,269 INFO  L185             Difference]: Start difference. First operand has 83 places, 85 transitions, 1031 flow. Second operand 8 states and 963 transitions.
[2021-03-11 20:27:04,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 97 transitions, 1338 flow
[2021-03-11 20:27:04,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 97 transitions, 1312 flow, removed 2 selfloop flow, removed 3 redundant places.
[2021-03-11 20:27:04,281 INFO  L241             Difference]: Finished difference. Result has 88 places, 80 transitions, 1015 flow
[2021-03-11 20:27:04,281 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=88, PETRI_TRANSITIONS=80}
[2021-03-11 20:27:04,281 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places.
[2021-03-11 20:27:04,281 INFO  L480      AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 1015 flow
[2021-03-11 20:27:04,281 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,281 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:04,281 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:04,281 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-03-11 20:27:04,281 INFO  L428      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:04,282 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:04,282 INFO  L82        PathProgramCache]: Analyzing trace with hash -1013806361, now seen corresponding path program 6 times
[2021-03-11 20:27:04,282 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:04,282 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002749991]
[2021-03-11 20:27:04,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:04,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:04,339 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,339 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:04,342 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size
[2021-03-11 20:27:04,342 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18
[2021-03-11 20:27:04,352 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,352 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:27:04,358 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,359 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-11 20:27:04,372 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,373 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-11 20:27:04,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:04,386 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002749991]
[2021-03-11 20:27:04,387 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:04,387 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:04,387 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636126507]
[2021-03-11 20:27:04,389 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:27:04,389 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:04,389 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:27:04,389 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:27:04,390 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182
[2021-03-11 20:27:04,390 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 1015 flow. Second operand  has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,390 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:04,390 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182
[2021-03-11 20:27:04,390 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:04,583 INFO  L129       PetriNetUnfolder]: 149/526 cut-off events.
[2021-03-11 20:27:04,583 INFO  L130       PetriNetUnfolder]: For 2886/3165 co-relation queries the response was YES.
[2021-03-11 20:27:04,586 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 526 events. 149/526 cut-off events. For 2886/3165 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4181 event pairs, 6 based on Foata normal form. 101/607 useless extension candidates. Maximal degree in co-relation 2485. Up to 150 conditions per place. 
[2021-03-11 20:27:04,587 INFO  L132   encePairwiseOnDemand]: 173/182 looper letters, 38 selfloop transitions, 19 changer transitions 13/96 dead transitions.
[2021-03-11 20:27:04,587 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 1380 flow
[2021-03-11 20:27:04,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 20:27:04,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:27:04,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions.
[2021-03-11 20:27:04,590 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.7001569858712716
[2021-03-11 20:27:04,590 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 892 transitions.
[2021-03-11 20:27:04,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions.
[2021-03-11 20:27:04,590 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:04,590 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions.
[2021-03-11 20:27:04,592 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,593 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,594 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,594 INFO  L185             Difference]: Start difference. First operand has 88 places, 80 transitions, 1015 flow. Second operand 7 states and 892 transitions.
[2021-03-11 20:27:04,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 1380 flow
[2021-03-11 20:27:04,604 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1273 flow, removed 4 selfloop flow, removed 8 redundant places.
[2021-03-11 20:27:04,605 INFO  L241             Difference]: Finished difference. Result has 89 places, 81 transitions, 992 flow
[2021-03-11 20:27:04,605 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=992, PETRI_PLACES=89, PETRI_TRANSITIONS=81}
[2021-03-11 20:27:04,605 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places.
[2021-03-11 20:27:04,605 INFO  L480      AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 992 flow
[2021-03-11 20:27:04,606 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,606 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:04,606 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:04,606 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-03-11 20:27:04,606 INFO  L428      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:04,606 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:04,606 INFO  L82        PathProgramCache]: Analyzing trace with hash 171659855, now seen corresponding path program 7 times
[2021-03-11 20:27:04,608 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:04,608 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545223944]
[2021-03-11 20:27:04,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:04,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:04,666 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,666 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:04,671 INFO  L142       QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size
[2021-03-11 20:27:04,672 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 20:27:04,684 INFO  L142       QuantifierPusher]: treesize reduction 24, result has 78.0 percent of original size
[2021-03-11 20:27:04,685 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 85
[2021-03-11 20:27:04,714 INFO  L142       QuantifierPusher]: treesize reduction 28, result has 64.6 percent of original size
[2021-03-11 20:27:04,714 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51
[2021-03-11 20:27:04,751 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:04,751 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11
[2021-03-11 20:27:04,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:04,762 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545223944]
[2021-03-11 20:27:04,762 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:04,762 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:04,762 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023629093]
[2021-03-11 20:27:04,763 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:27:04,763 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:04,763 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:27:04,763 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:27:04,764 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 182
[2021-03-11 20:27:04,764 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 992 flow. Second operand  has 7 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:04,764 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:04,765 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 182
[2021-03-11 20:27:04,765 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:05,017 INFO  L129       PetriNetUnfolder]: 147/516 cut-off events.
[2021-03-11 20:27:05,017 INFO  L130       PetriNetUnfolder]: For 2717/2921 co-relation queries the response was YES.
[2021-03-11 20:27:05,019 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 516 events. 147/516 cut-off events. For 2717/2921 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4036 event pairs, 1 based on Foata normal form. 86/579 useless extension candidates. Maximal degree in co-relation 2349. Up to 155 conditions per place. 
[2021-03-11 20:27:05,021 INFO  L132   encePairwiseOnDemand]: 172/182 looper letters, 29 selfloop transitions, 25 changer transitions 14/94 dead transitions.
[2021-03-11 20:27:05,021 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 1276 flow
[2021-03-11 20:27:05,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-03-11 20:27:05,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 20:27:05,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1090 transitions.
[2021-03-11 20:27:05,024 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6654456654456654
[2021-03-11 20:27:05,024 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1090 transitions.
[2021-03-11 20:27:05,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1090 transitions.
[2021-03-11 20:27:05,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:05,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1090 transitions.
[2021-03-11 20:27:05,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 121.11111111111111) internal successors, (1090), 9 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,028 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,028 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,028 INFO  L185             Difference]: Start difference. First operand has 89 places, 81 transitions, 992 flow. Second operand 9 states and 1090 transitions.
[2021-03-11 20:27:05,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 1276 flow
[2021-03-11 20:27:05,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 1209 flow, removed 12 selfloop flow, removed 5 redundant places.
[2021-03-11 20:27:05,041 INFO  L241             Difference]: Finished difference. Result has 95 places, 77 transitions, 943 flow
[2021-03-11 20:27:05,041 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=95, PETRI_TRANSITIONS=77}
[2021-03-11 20:27:05,042 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places.
[2021-03-11 20:27:05,042 INFO  L480      AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 943 flow
[2021-03-11 20:27:05,042 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,042 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:05,042 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:05,042 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-03-11 20:27:05,042 INFO  L428      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:05,042 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:05,043 INFO  L82        PathProgramCache]: Analyzing trace with hash -768963759, now seen corresponding path program 8 times
[2021-03-11 20:27:05,043 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:05,043 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491804976]
[2021-03-11 20:27:05,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:05,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:05,086 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,087 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:05,091 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,092 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 20:27:05,099 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,099 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:27:05,105 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,106 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11
[2021-03-11 20:27:05,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:05,113 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491804976]
[2021-03-11 20:27:05,113 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:05,113 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:27:05,113 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825178907]
[2021-03-11 20:27:05,113 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 20:27:05,113 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:05,114 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 20:27:05,114 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-03-11 20:27:05,114 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182
[2021-03-11 20:27:05,115 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 943 flow. Second operand  has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,115 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:05,115 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182
[2021-03-11 20:27:05,115 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:05,274 INFO  L129       PetriNetUnfolder]: 131/462 cut-off events.
[2021-03-11 20:27:05,274 INFO  L130       PetriNetUnfolder]: For 2447/2634 co-relation queries the response was YES.
[2021-03-11 20:27:05,276 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 462 events. 131/462 cut-off events. For 2447/2634 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 3466 event pairs, 1 based on Foata normal form. 59/497 useless extension candidates. Maximal degree in co-relation 2106. Up to 140 conditions per place. 
[2021-03-11 20:27:05,277 INFO  L132   encePairwiseOnDemand]: 174/182 looper letters, 33 selfloop transitions, 15 changer transitions 12/86 dead transitions.
[2021-03-11 20:27:05,277 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 1165 flow
[2021-03-11 20:27:05,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 20:27:05,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:27:05,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions.
[2021-03-11 20:27:05,279 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6923076923076923
[2021-03-11 20:27:05,279 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 756 transitions.
[2021-03-11 20:27:05,279 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions.
[2021-03-11 20:27:05,279 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:05,279 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions.
[2021-03-11 20:27:05,280 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,281 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,281 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,281 INFO  L185             Difference]: Start difference. First operand has 95 places, 77 transitions, 943 flow. Second operand 6 states and 756 transitions.
[2021-03-11 20:27:05,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 1165 flow
[2021-03-11 20:27:05,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 1038 flow, removed 13 selfloop flow, removed 14 redundant places.
[2021-03-11 20:27:05,291 INFO  L241             Difference]: Finished difference. Result has 85 places, 73 transitions, 796 flow
[2021-03-11 20:27:05,291 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=85, PETRI_TRANSITIONS=73}
[2021-03-11 20:27:05,291 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places.
[2021-03-11 20:27:05,291 INFO  L480      AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 796 flow
[2021-03-11 20:27:05,291 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,291 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:05,291 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:05,291 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-03-11 20:27:05,291 INFO  L428      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:05,292 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:05,292 INFO  L82        PathProgramCache]: Analyzing trace with hash 1179284937, now seen corresponding path program 9 times
[2021-03-11 20:27:05,292 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:05,292 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459819383]
[2021-03-11 20:27:05,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:05,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:05,331 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,332 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:05,335 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,336 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 20:27:05,342 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size
[2021-03-11 20:27:05,342 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47
[2021-03-11 20:27:05,356 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,356 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-11 20:27:05,365 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,366 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:05,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:05,372 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459819383]
[2021-03-11 20:27:05,372 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:05,372 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:05,373 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220101917]
[2021-03-11 20:27:05,374 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:27:05,374 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:05,374 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:27:05,374 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:27:05,375 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182
[2021-03-11 20:27:05,376 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 796 flow. Second operand  has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,376 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:05,376 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182
[2021-03-11 20:27:05,376 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:05,506 INFO  L129       PetriNetUnfolder]: 128/462 cut-off events.
[2021-03-11 20:27:05,506 INFO  L130       PetriNetUnfolder]: For 2575/2828 co-relation queries the response was YES.
[2021-03-11 20:27:05,508 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 462 events. 128/462 cut-off events. For 2575/2828 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3488 event pairs, 3 based on Foata normal form. 75/514 useless extension candidates. Maximal degree in co-relation 2120. Up to 130 conditions per place. 
[2021-03-11 20:27:05,509 INFO  L132   encePairwiseOnDemand]: 175/182 looper letters, 43 selfloop transitions, 2 changer transitions 24/95 dead transitions.
[2021-03-11 20:27:05,509 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 1252 flow
[2021-03-11 20:27:05,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 20:27:05,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:27:05,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1028 transitions.
[2021-03-11 20:27:05,510 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.7060439560439561
[2021-03-11 20:27:05,510 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,510 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,510 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:05,510 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,511 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 128.5) internal successors, (1028), 8 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,513 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,513 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,513 INFO  L185             Difference]: Start difference. First operand has 85 places, 73 transitions, 796 flow. Second operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 1252 flow
[2021-03-11 20:27:05,522 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 1210 flow, removed 9 selfloop flow, removed 4 redundant places.
[2021-03-11 20:27:05,523 INFO  L241             Difference]: Finished difference. Result has 92 places, 71 transitions, 778 flow
[2021-03-11 20:27:05,523 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=92, PETRI_TRANSITIONS=71}
[2021-03-11 20:27:05,523 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places.
[2021-03-11 20:27:05,523 INFO  L480      AbstractCegarLoop]: Abstraction has has 92 places, 71 transitions, 778 flow
[2021-03-11 20:27:05,523 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,524 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:05,524 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:05,524 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-03-11 20:27:05,524 INFO  L428      AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:05,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:05,524 INFO  L82        PathProgramCache]: Analyzing trace with hash 429752635, now seen corresponding path program 10 times
[2021-03-11 20:27:05,524 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:05,524 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094561673]
[2021-03-11 20:27:05,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:05,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:05,582 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,582 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:05,587 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size
[2021-03-11 20:27:05,588 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47
[2021-03-11 20:27:05,601 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size
[2021-03-11 20:27:05,601 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50
[2021-03-11 20:27:05,617 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,618 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-11 20:27:05,630 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,631 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:27:05,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:05,636 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094561673]
[2021-03-11 20:27:05,636 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:05,636 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:27:05,637 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722588628]
[2021-03-11 20:27:05,637 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:27:05,637 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:05,637 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:27:05,637 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:27:05,638 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182
[2021-03-11 20:27:05,638 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 71 transitions, 778 flow. Second operand  has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,638 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:05,638 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182
[2021-03-11 20:27:05,638 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:05,830 INFO  L129       PetriNetUnfolder]: 114/416 cut-off events.
[2021-03-11 20:27:05,830 INFO  L130       PetriNetUnfolder]: For 2061/2284 co-relation queries the response was YES.
[2021-03-11 20:27:05,832 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 416 events. 114/416 cut-off events. For 2061/2284 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3052 event pairs, 1 based on Foata normal form. 67/460 useless extension candidates. Maximal degree in co-relation 1848. Up to 125 conditions per place. 
[2021-03-11 20:27:05,832 INFO  L132   encePairwiseOnDemand]: 175/182 looper letters, 23 selfloop transitions, 9 changer transitions 26/84 dead transitions.
[2021-03-11 20:27:05,833 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 84 transitions, 1063 flow
[2021-03-11 20:27:05,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 20:27:05,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:27:05,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1028 transitions.
[2021-03-11 20:27:05,836 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.7060439560439561
[2021-03-11 20:27:05,836 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:05,837 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,841 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 128.5) internal successors, (1028), 8 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,842 INFO  L185             Difference]: Start difference. First operand has 92 places, 71 transitions, 778 flow. Second operand 8 states and 1028 transitions.
[2021-03-11 20:27:05,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 84 transitions, 1063 flow
[2021-03-11 20:27:05,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 1021 flow, removed 13 selfloop flow, removed 8 redundant places.
[2021-03-11 20:27:05,851 INFO  L241             Difference]: Finished difference. Result has 88 places, 57 transitions, 560 flow
[2021-03-11 20:27:05,851 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=560, PETRI_PLACES=88, PETRI_TRANSITIONS=57}
[2021-03-11 20:27:05,851 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places.
[2021-03-11 20:27:05,851 INFO  L480      AbstractCegarLoop]: Abstraction has has 88 places, 57 transitions, 560 flow
[2021-03-11 20:27:05,852 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,852 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:05,852 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:05,852 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-03-11 20:27:05,852 INFO  L428      AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:05,852 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:05,852 INFO  L82        PathProgramCache]: Analyzing trace with hash -1367908273, now seen corresponding path program 11 times
[2021-03-11 20:27:05,852 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:05,852 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33557970]
[2021-03-11 20:27:05,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:05,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:05,916 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,917 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:27:05,919 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size
[2021-03-11 20:27:05,919 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-11 20:27:05,926 INFO  L142       QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size
[2021-03-11 20:27:05,927 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-03-11 20:27:05,940 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:05,940 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:27:05,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:05,944 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33557970]
[2021-03-11 20:27:05,944 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:05,944 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:27:05,944 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870218074]
[2021-03-11 20:27:05,944 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:27:05,944 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:05,945 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:27:05,945 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:27:05,945 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 182
[2021-03-11 20:27:05,946 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 57 transitions, 560 flow. Second operand  has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:05,946 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:05,946 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 182
[2021-03-11 20:27:05,946 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:06,045 INFO  L129       PetriNetUnfolder]: 81/295 cut-off events.
[2021-03-11 20:27:06,045 INFO  L130       PetriNetUnfolder]: For 1105/1201 co-relation queries the response was YES.
[2021-03-11 20:27:06,047 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 295 events. 81/295 cut-off events. For 1105/1201 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1927 event pairs, 0 based on Foata normal form. 36/315 useless extension candidates. Maximal degree in co-relation 1255. Up to 95 conditions per place. 
[2021-03-11 20:27:06,048 INFO  L132   encePairwiseOnDemand]: 177/182 looper letters, 25 selfloop transitions, 2 changer transitions 11/64 dead transitions.
[2021-03-11 20:27:06,048 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 64 transitions, 706 flow
[2021-03-11 20:27:06,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 20:27:06,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:27:06,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions.
[2021-03-11 20:27:06,050 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.7271062271062271
[2021-03-11 20:27:06,050 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 794 transitions.
[2021-03-11 20:27:06,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions.
[2021-03-11 20:27:06,050 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:06,050 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions.
[2021-03-11 20:27:06,051 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,052 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,052 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,052 INFO  L185             Difference]: Start difference. First operand has 88 places, 57 transitions, 560 flow. Second operand 6 states and 794 transitions.
[2021-03-11 20:27:06,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 64 transitions, 706 flow
[2021-03-11 20:27:06,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 64 transitions, 640 flow, removed 12 selfloop flow, removed 12 redundant places.
[2021-03-11 20:27:06,057 INFO  L241             Difference]: Finished difference. Result has 79 places, 53 transitions, 447 flow
[2021-03-11 20:27:06,058 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=79, PETRI_TRANSITIONS=53}
[2021-03-11 20:27:06,058 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places.
[2021-03-11 20:27:06,058 INFO  L480      AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 447 flow
[2021-03-11 20:27:06,058 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,058 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:06,058 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:06,058 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-03-11 20:27:06,058 INFO  L428      AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:06,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:06,058 INFO  L82        PathProgramCache]: Analyzing trace with hash 1411507215, now seen corresponding path program 12 times
[2021-03-11 20:27:06,059 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:06,059 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220945095]
[2021-03-11 20:27:06,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:06,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:27:06,130 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:06,131 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 20:27:06,138 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size
[2021-03-11 20:27:06,139 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53
[2021-03-11 20:27:06,158 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size
[2021-03-11 20:27:06,158 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50
[2021-03-11 20:27:06,177 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size
[2021-03-11 20:27:06,177 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53
[2021-03-11 20:27:06,201 INFO  L142       QuantifierPusher]: treesize reduction 39, result has 68.3 percent of original size
[2021-03-11 20:27:06,202 INFO  L147       QuantifierPusher]: treesize reduction 8, result has 90.5 percent of original size 76
[2021-03-11 20:27:06,241 INFO  L142       QuantifierPusher]: treesize reduction 27, result has 77.5 percent of original size
[2021-03-11 20:27:06,242 INFO  L147       QuantifierPusher]: treesize reduction 9, result has 90.3 percent of original size 84
[2021-03-11 20:27:06,285 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 85.1 percent of original size
[2021-03-11 20:27:06,285 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57
[2021-03-11 20:27:06,314 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:06,314 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20
[2021-03-11 20:27:06,332 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:27:06,333 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-03-11 20:27:06,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:27:06,347 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220945095]
[2021-03-11 20:27:06,347 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:27:06,347 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-03-11 20:27:06,348 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641432507]
[2021-03-11 20:27:06,348 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-03-11 20:27:06,348 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:27:06,348 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-03-11 20:27:06,348 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2021-03-11 20:27:06,349 INFO  L500   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182
[2021-03-11 20:27:06,350 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 53 transitions, 447 flow. Second operand  has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,350 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:27:06,350 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182
[2021-03-11 20:27:06,350 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:27:06,579 INFO  L129       PetriNetUnfolder]: 94/335 cut-off events.
[2021-03-11 20:27:06,579 INFO  L130       PetriNetUnfolder]: For 896/993 co-relation queries the response was YES.
[2021-03-11 20:27:06,581 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 335 events. 94/335 cut-off events. For 896/993 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2303 event pairs, 0 based on Foata normal form. 34/346 useless extension candidates. Maximal degree in co-relation 1339. Up to 115 conditions per place. 
[2021-03-11 20:27:06,581 INFO  L132   encePairwiseOnDemand]: 176/182 looper letters, 15 selfloop transitions, 6 changer transitions 15/62 dead transitions.
[2021-03-11 20:27:06,581 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 62 transitions, 610 flow
[2021-03-11 20:27:06,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 20:27:06,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:27:06,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions.
[2021-03-11 20:27:06,583 INFO  L545   CegarLoopForPetriNet]: DFA transition density 0.6671899529042387
[2021-03-11 20:27:06,583 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 850 transitions.
[2021-03-11 20:27:06,583 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions.
[2021-03-11 20:27:06,583 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:27:06,583 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions.
[2021-03-11 20:27:06,584 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,585 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,585 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,585 INFO  L185             Difference]: Start difference. First operand has 79 places, 53 transitions, 447 flow. Second operand 7 states and 850 transitions.
[2021-03-11 20:27:06,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 62 transitions, 610 flow
[2021-03-11 20:27:06,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 572 flow, removed 2 selfloop flow, removed 8 redundant places.
[2021-03-11 20:27:06,590 INFO  L241             Difference]: Finished difference. Result has 74 places, 45 transitions, 342 flow
[2021-03-11 20:27:06,590 INFO  L318   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=74, PETRI_TRANSITIONS=45}
[2021-03-11 20:27:06,591 INFO  L335   CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places.
[2021-03-11 20:27:06,591 INFO  L480      AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 342 flow
[2021-03-11 20:27:06,591 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:27:06,591 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:27:06,591 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:27:06,591 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-03-11 20:27:06,591 INFO  L428      AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:27:06,591 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:27:06,591 INFO  L82        PathProgramCache]: Analyzing trace with hash -2108748099, now seen corresponding path program 13 times
[2021-03-11 20:27:06,591 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:27:06,592 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084935204]
[2021-03-11 20:27:06,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:27:06,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 20:27:06,623 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 20:27:06,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 20:27:06,692 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 20:27:06,727 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-11 20:27:06,728 INFO  L620         BasicCegarLoop]: Counterexample might be feasible
[2021-03-11 20:27:06,728 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-03-11 20:27:06,788 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:27:06 BasicIcfg
[2021-03-11 20:27:06,788 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-11 20:27:06,788 INFO  L168              Benchmark]: Toolchain (without parser) took 23148.27 ms. Allocated memory was 255.9 MB in the beginning and 828.4 MB in the end (delta: 572.5 MB). Free memory was 235.5 MB in the beginning and 752.7 MB in the end (delta: -517.2 MB). Peak memory consumption was 500.0 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,788 INFO  L168              Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,788 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 422.34 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.9 MB in the beginning and 306.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,789 INFO  L168              Benchmark]: Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 303.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,789 INFO  L168              Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 350.2 MB. Free memory was 303.5 MB in the beginning and 300.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,789 INFO  L168              Benchmark]: RCFGBuilder took 2163.21 ms. Allocated memory was 350.2 MB in the beginning and 421.5 MB in the end (delta: 71.3 MB). Free memory was 300.6 MB in the beginning and 329.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 180.2 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,789 INFO  L168              Benchmark]: TraceAbstraction took 20481.61 ms. Allocated memory was 421.5 MB in the beginning and 828.4 MB in the end (delta: 406.8 MB). Free memory was 329.5 MB in the beginning and 752.7 MB in the end (delta: -423.2 MB). Peak memory consumption was 428.2 MB. Max. memory is 16.0 GB.
[2021-03-11 20:27:06,789 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 422.34 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.9 MB in the beginning and 306.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 303.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 25.83 ms. Allocated memory is still 350.2 MB. Free memory was 303.5 MB in the beginning and 300.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2163.21 ms. Allocated memory was 350.2 MB in the beginning and 421.5 MB in the end (delta: 71.3 MB). Free memory was 300.6 MB in the beginning and 329.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 180.2 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 20481.61 ms. Allocated memory was 421.5 MB in the beginning and 828.4 MB in the end (delta: 406.8 MB). Free memory was 329.5 MB in the beginning and 752.7 MB in the end (delta: -423.2 MB). Peak memory consumption was 428.2 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 12383.0ms, 104 PlacesBefore, 34 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 5207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1830, positive: 1638, positive conditional: 0, positive unconditional: 1638, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1109, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1109, positive: 1041, positive conditional: 0, positive unconditional: 1041, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 609, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 547, negative conditional: 0, negative unconditional: 547, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1830, positive: 571, positive conditional: 0, positive unconditional: 571, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 1109, unknown conditional: 0, unknown unconditional: 1109] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L716]               0  int __unbuffered_p2_EBX = 0;
[L717]               0  _Bool main$tmp_guard0;
[L718]               0  _Bool main$tmp_guard1;
[L720]               0  int x = 0;
[L722]               0  int y = 0;
[L723]               0  _Bool y$flush_delayed;
[L724]               0  int y$mem_tmp;
[L725]               0  _Bool y$r_buff0_thd0;
[L726]               0  _Bool y$r_buff0_thd1;
[L727]               0  _Bool y$r_buff0_thd2;
[L728]               0  _Bool y$r_buff0_thd3;
[L729]               0  _Bool y$r_buff1_thd0;
[L730]               0  _Bool y$r_buff1_thd1;
[L731]               0  _Bool y$r_buff1_thd2;
[L732]               0  _Bool y$r_buff1_thd3;
[L733]               0  _Bool y$read_delayed;
[L734]               0  int *y$read_delayed_var;
[L735]               0  int y$w_buff0;
[L736]               0  _Bool y$w_buff0_used;
[L737]               0  int y$w_buff1;
[L738]               0  _Bool y$w_buff1_used;
[L739]               0  _Bool weak$$choice0;
[L740]               0  _Bool weak$$choice2;
[L854]               0  pthread_t t2321;
[L855]  FCALL, FORK  0  pthread_create(&t2321, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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]
[L856]               0  pthread_t t2322;
[L857]  FCALL, FORK  0  pthread_create(&t2322, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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]
[L784]               2  y$w_buff1 = y$w_buff0
[L785]               2  y$w_buff0 = 2
[L786]               2  y$w_buff1_used = y$w_buff0_used
[L787]               2  y$w_buff0_used = (_Bool)1
[L19]   COND FALSE   2  !(!expression)
[L789]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L790]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L791]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L792]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L793]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L858]               0  pthread_t t2323;
[L859]  FCALL, FORK  0  pthread_create(&t2323, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L813]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L816]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               3  y$flush_delayed = weak$$choice2
[L819]               3  y$mem_tmp = y
[L820]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L820]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  __unbuffered_p2_EBX = y
[L828]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L828]               3  y = y$flush_delayed ? y$mem_tmp : y
[L829]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L832]  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)
[L832]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L832]  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)
[L832]               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)
[L833]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L834]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834]               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
[L835]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L836]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L836]               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
[L744]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L748]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L751]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]  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)
[L758]               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)
[L759]  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))
[L759]               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))
[L760]  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))
[L760]               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))
[L761]  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))
[L761]               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))
[L762]  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))
[L762]               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))
[L763]  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))
[L763]               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))
[L764]  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))
[L764]               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))
[L765]               1  __unbuffered_p0_EAX = y
[L766]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L799]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L800]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L800]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L801]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L802]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L802]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L803]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L803]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L771]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L771]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L772]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L773]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L774]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L774]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L808]               2  return 0;
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L841]               3  return 0;
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L779]               1  return 0;
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L867]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L869]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L872]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L873]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L874]               0  y$flush_delayed = weak$$choice2
[L875]               0  y$mem_tmp = y
[L876]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L876]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L883]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L884]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L884]               0  y = y$flush_delayed ? y$mem_tmp : y
[L885]               0  y$flush_delayed = (_Bool)0
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20288.6ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4303.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12449.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 96 SDtfs, 84 SDslu, 75 SDs, 0 SdLazy, 1095 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1396.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2491.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1031occurred in iteration=14, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 72.3ms SsaConstructionTime, 665.7ms SatisfiabilityAnalysisTime, 2475.2ms InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 4439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...