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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:39:23,197 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:39:23,200 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:39:23,236 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:39:23,236 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:39:23,244 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:39:23,246 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:39:23,250 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:39:23,252 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:39:23,255 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:39:23,256 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:39:23,257 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:39:23,257 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:39:23,259 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:39:23,261 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:39:23,263 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:39:23,265 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:39:23,266 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:39:23,267 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:39:23,274 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:39:23,276 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:39:23,277 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:39:23,278 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:39:23,279 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:39:23,290 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:39:23,290 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:39:23,290 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:39:23,296 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:39:23,297 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:39:23,297 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:39:23,298 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:39:23,301 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:39:23,302 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:39:23,303 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:39:23,304 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:39:23,304 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:39:23,304 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:39:23,305 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:39:23,305 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:39:23,306 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:39:23,306 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:39:23,307 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2020-10-16 01:39:23,327 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:39:23,328 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:39:23,329 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:39:23,329 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:39:23,329 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:39:23,329 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:39:23,330 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:39:23,330 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:39:23,330 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:39:23,330 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:39:23,330 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:39:23,331 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:39:23,332 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:39:23,332 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:39:23,332 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:39:23,332 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:39:23,332 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:39:23,333 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:39:23,333 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:39:23,333 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:39:23,333 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:39:23,334 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:39:23,334 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:39:23,334 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:39:23,639 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:39:23,656 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:39:23,660 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:39:23,661 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:39:23,665 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:39:23,666 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i
[2020-10-16 01:39:23,734 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d141cf40/c40625ff6ac1486691e6347dd22c23f7/FLAGa984806b0
[2020-10-16 01:39:24,196 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:39:24,196 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i
[2020-10-16 01:39:24,210 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d141cf40/c40625ff6ac1486691e6347dd22c23f7/FLAGa984806b0
[2020-10-16 01:39:24,484 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d141cf40/c40625ff6ac1486691e6347dd22c23f7
[2020-10-16 01:39:24,493 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:39:24,495 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:39:24,497 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:24,498 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:39:24,501 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:39:24,502 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:24" (1/1) ...
[2020-10-16 01:39:24,505 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c687a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:24, skipping insertion in model container
[2020-10-16 01:39:24,505 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:24" (1/1) ...
[2020-10-16 01:39:24,513 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:39:24,556 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:39:25,010 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:25,022 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:39:25,082 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:25,160 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:39:25,160 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25 WrapperNode
[2020-10-16 01:39:25,160 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:25,161 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:25,161 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:39:25,162 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:39:25,170 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,191 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,221 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:25,221 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:39:25,222 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:39:25,222 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:39:25,231 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,231 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,235 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,236 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,245 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,249 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,252 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
[2020-10-16 01:39:25,257 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:39:25,258 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:39:25,258 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:39:25,258 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:39:25,259 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:39:25,320 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:39:25,320 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:39:25,320 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:39:25,320 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:39:25,321 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:39:25,326 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:39:25,326 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:39:25,326 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:39:25,327 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:39:25,327 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:39:25,327 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:39:25,327 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:39:25,327 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:39:25,330 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 01:39:27,090 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:39:27,091 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:39:27,093 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:27 BoogieIcfgContainer
[2020-10-16 01:39:27,093 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:39:27,094 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:39:27,094 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:39:27,097 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:39:27,098 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:39:24" (1/3) ...
[2020-10-16 01:39:27,099 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197fe311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:27, skipping insertion in model container
[2020-10-16 01:39:27,099 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:25" (2/3) ...
[2020-10-16 01:39:27,099 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197fe311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:27, skipping insertion in model container
[2020-10-16 01:39:27,099 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:27" (3/3) ...
[2020-10-16 01:39:27,101 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe012_rmo.opt.i
[2020-10-16 01:39:27,113 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:39:27,120 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:39:27,121 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:39:27,151 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,152 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,152 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,152 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,153 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,153 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,154 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,154 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,154 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,154 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,154 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,155 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,156 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,156 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,156 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,156 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,156 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,158 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,160 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,160 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,160 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,162 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,162 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,163 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,164 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,166 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,166 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,166 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,166 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,166 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,172 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,173 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,173 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,175 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,179 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,180 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,181 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,183 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,183 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,183 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,184 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,184 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,184 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,184 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,184 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,185 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,185 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,185 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,185 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,185 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,186 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,186 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,186 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,186 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,186 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,187 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,188 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,188 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,188 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:27,205 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 01:39:27,226 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:39:27,227 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:39:27,227 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:39:27,227 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:39:27,227 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:39:27,227 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:39:27,227 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:39:27,227 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:39:27,241 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow
[2020-10-16 01:39:27,284 INFO  L129       PetriNetUnfolder]: 2/90 cut-off events.
[2020-10-16 01:39:27,284 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:27,289 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 01:39:27,289 INFO  L82        GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow
[2020-10-16 01:39:27,295 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow
[2020-10-16 01:39:27,297 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:39:27,300 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 189 flow
[2020-10-16 01:39:27,303 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 189 flow
[2020-10-16 01:39:27,303 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 189 flow
[2020-10-16 01:39:27,335 INFO  L129       PetriNetUnfolder]: 2/90 cut-off events.
[2020-10-16 01:39:27,336 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:27,337 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 01:39:27,341 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 01:39:27,414 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:27,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:27,780 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:27,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:27,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:27,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,213 WARN  L193               SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:39:28,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:28,347 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,348 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:28,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,352 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:28,353 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:28,356 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:28,356 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:28,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:28,376 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:28,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:28,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:28,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:28,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:28,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:28,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,692 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,694 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,696 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,696 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:28,699 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,704 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,777 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,778 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:39:28,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:28,782 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:28,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:28,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:28,874 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:28,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,876 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,917 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:39:28,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:28,920 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:28,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:28,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:39:28,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:28,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,025 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:29,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,032 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,032 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,033 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,035 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,035 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,038 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,039 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,100 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,100 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,101 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,102 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,102 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,103 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:39:29,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,598 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,599 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,601 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,602 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,604 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,644 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,644 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:29,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,658 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:29,659 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,661 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:29,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:29,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:29,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:29,795 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:29,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,799 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,801 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,801 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,803 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,804 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:29,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,817 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,818 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:29,938 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:29,938 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 01:39:29,940 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:29,941 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,009 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,014 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,014 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,016 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,017 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,035 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,036 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,082 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,085 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,112 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,166 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,166 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,167 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,168 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,171 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:30,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,193 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,193 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,198 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:30,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,290 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 01:39:30,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:30,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,325 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:30,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:30,327 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,327 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:30,328 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,329 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:30,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:30,331 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:30,332 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:30,335 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:30,902 WARN  L193               SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89
[2020-10-16 01:39:31,025 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2020-10-16 01:39:31,032 INFO  L132        LiptonReduction]: Checked pairs total: 3795
[2020-10-16 01:39:31,032 INFO  L134        LiptonReduction]: Total number of compositions: 76
[2020-10-16 01:39:31,035 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3740
[2020-10-16 01:39:31,041 INFO  L129       PetriNetUnfolder]: 0/9 cut-off events.
[2020-10-16 01:39:31,042 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:31,042 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,043 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 01:39:31,043 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,049 INFO  L82        PathProgramCache]: Analyzing trace with hash 913841179, now seen corresponding path program 1 times
[2020-10-16 01:39:31,056 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,057 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723839149]
[2020-10-16 01:39:31,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:31,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:31,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:31,314 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723839149]
[2020-10-16 01:39:31,315 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:31,315 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:39:31,315 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038169229]
[2020-10-16 01:39:31,325 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:39:31,326 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:31,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:39:31,342 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:39:31,344 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 169
[2020-10-16 01:39:31,346 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states.
[2020-10-16 01:39:31,346 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:31,347 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 169
[2020-10-16 01:39:31,348 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:31,426 INFO  L129       PetriNetUnfolder]: 29/103 cut-off events.
[2020-10-16 01:39:31,427 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:31,427 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 167 conditions, 103 events. 29/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 409 event pairs, 15 based on Foata normal form. 11/97 useless extension candidates. Maximal degree in co-relation 157. Up to 41 conditions per place. 
[2020-10-16 01:39:31,429 INFO  L132   encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions.
[2020-10-16 01:39:31,430 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow
[2020-10-16 01:39:31,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:39:31,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:39:31,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2020-10-16 01:39:31,447 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8698224852071006
[2020-10-16 01:39:31,448 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2020-10-16 01:39:31,448 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2020-10-16 01:39:31,450 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:31,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2020-10-16 01:39:31,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:39:31,464 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:39:31,464 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:39:31,467 INFO  L185             Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 441 transitions.
[2020-10-16 01:39:31,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow
[2020-10-16 01:39:31,470 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:31,472 INFO  L241             Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow
[2020-10-16 01:39:31,475 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22}
[2020-10-16 01:39:31,476 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places.
[2020-10-16 01:39:31,476 INFO  L481      AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow
[2020-10-16 01:39:31,476 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:39:31,476 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,476 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:31,477 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:39:31,477 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,477 INFO  L82        PathProgramCache]: Analyzing trace with hash 1273904906, now seen corresponding path program 1 times
[2020-10-16 01:39:31,478 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,478 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695928808]
[2020-10-16 01:39:31,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:31,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:31,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:31,604 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695928808]
[2020-10-16 01:39:31,604 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:31,604 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:39:31,604 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884216921]
[2020-10-16 01:39:31,606 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:31,606 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:31,606 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:31,607 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:31,609 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 169
[2020-10-16 01:39:31,609 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states.
[2020-10-16 01:39:31,610 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:31,610 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 169
[2020-10-16 01:39:31,610 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:31,641 INFO  L129       PetriNetUnfolder]: 2/30 cut-off events.
[2020-10-16 01:39:31,641 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:31,641 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 30 events. 2/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. 
[2020-10-16 01:39:31,642 INFO  L132   encePairwiseOnDemand]: 164/169 looper letters, 2 selfloop transitions, 2 changer transitions 5/26 dead transitions.
[2020-10-16 01:39:31,642 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 80 flow
[2020-10-16 01:39:31,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:31,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:31,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions.
[2020-10-16 01:39:31,646 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8532544378698225
[2020-10-16 01:39:31,646 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 721 transitions.
[2020-10-16 01:39:31,646 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 721 transitions.
[2020-10-16 01:39:31,647 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:31,647 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 721 transitions.
[2020-10-16 01:39:31,651 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:31,654 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:31,654 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:31,654 INFO  L185             Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 721 transitions.
[2020-10-16 01:39:31,654 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 80 flow
[2020-10-16 01:39:31,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:31,655 INFO  L241             Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow
[2020-10-16 01:39:31,656 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21}
[2020-10-16 01:39:31,656 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places.
[2020-10-16 01:39:31,656 INFO  L481      AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow
[2020-10-16 01:39:31,657 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:31,657 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,657 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:31,657 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:39:31,657 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,657 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,658 INFO  L82        PathProgramCache]: Analyzing trace with hash 813510977, now seen corresponding path program 1 times
[2020-10-16 01:39:31,658 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,658 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484645279]
[2020-10-16 01:39:31,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:31,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:31,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:31,722 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484645279]
[2020-10-16 01:39:31,722 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:31,722 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:39:31,723 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187641010]
[2020-10-16 01:39:31,723 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:31,723 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:31,723 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:31,724 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:31,725 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 169
[2020-10-16 01:39:31,726 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand 4 states.
[2020-10-16 01:39:31,726 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:31,726 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 169
[2020-10-16 01:39:31,726 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:31,746 INFO  L129       PetriNetUnfolder]: 0/25 cut-off events.
[2020-10-16 01:39:31,746 INFO  L130       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2020-10-16 01:39:31,746 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 0/25 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. 
[2020-10-16 01:39:31,747 INFO  L132   encePairwiseOnDemand]: 165/169 looper letters, 2 selfloop transitions, 2 changer transitions 2/23 dead transitions.
[2020-10-16 01:39:31,747 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 78 flow
[2020-10-16 01:39:31,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:31,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:31,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions.
[2020-10-16 01:39:31,750 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8437869822485207
[2020-10-16 01:39:31,750 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 713 transitions.
[2020-10-16 01:39:31,750 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions.
[2020-10-16 01:39:31,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:31,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions.
[2020-10-16 01:39:31,752 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:31,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:31,754 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:31,754 INFO  L185             Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 713 transitions.
[2020-10-16 01:39:31,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 78 flow
[2020-10-16 01:39:31,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 4 redundant places.
[2020-10-16 01:39:31,755 INFO  L241             Difference]: Finished difference. Result has 36 places, 21 transitions, 64 flow
[2020-10-16 01:39:31,756 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=21}
[2020-10-16 01:39:31,756 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places.
[2020-10-16 01:39:31,756 INFO  L481      AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 64 flow
[2020-10-16 01:39:31,756 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:31,756 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,757 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:31,757 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:39:31,757 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,757 INFO  L82        PathProgramCache]: Analyzing trace with hash 156855132, now seen corresponding path program 1 times
[2020-10-16 01:39:31,758 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,758 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166869602]
[2020-10-16 01:39:31,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:31,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:31,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:31,814 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166869602]
[2020-10-16 01:39:31,814 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:31,815 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:31,815 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899999667]
[2020-10-16 01:39:31,815 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:31,815 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:31,816 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:31,816 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:31,818 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 169
[2020-10-16 01:39:31,818 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 64 flow. Second operand 5 states.
[2020-10-16 01:39:31,818 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:31,818 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 169
[2020-10-16 01:39:31,819 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:31,859 INFO  L129       PetriNetUnfolder]: 1/31 cut-off events.
[2020-10-16 01:39:31,859 INFO  L130       PetriNetUnfolder]: For 12/14 co-relation queries the response was YES.
[2020-10-16 01:39:31,859 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 67 conditions, 31 events. 1/31 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 3/34 useless extension candidates. Maximal degree in co-relation 56. Up to 6 conditions per place. 
[2020-10-16 01:39:31,860 INFO  L132   encePairwiseOnDemand]: 164/169 looper letters, 2 selfloop transitions, 3 changer transitions 4/25 dead transitions.
[2020-10-16 01:39:31,860 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 99 flow
[2020-10-16 01:39:31,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:31,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:31,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions.
[2020-10-16 01:39:31,863 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8155818540433925
[2020-10-16 01:39:31,863 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 827 transitions.
[2020-10-16 01:39:31,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions.
[2020-10-16 01:39:31,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:31,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions.
[2020-10-16 01:39:31,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:31,867 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:31,867 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:31,867 INFO  L185             Difference]: Start difference. First operand has 36 places, 21 transitions, 64 flow. Second operand 6 states and 827 transitions.
[2020-10-16 01:39:31,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 99 flow
[2020-10-16 01:39:31,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 91 flow, removed 2 selfloop flow, removed 4 redundant places.
[2020-10-16 01:39:31,869 INFO  L241             Difference]: Finished difference. Result has 39 places, 21 transitions, 74 flow
[2020-10-16 01:39:31,869 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=21}
[2020-10-16 01:39:31,870 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places.
[2020-10-16 01:39:31,870 INFO  L481      AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 74 flow
[2020-10-16 01:39:31,870 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:31,870 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,870 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:31,870 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:39:31,871 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,871 INFO  L82        PathProgramCache]: Analyzing trace with hash -2014680744, now seen corresponding path program 1 times
[2020-10-16 01:39:31,871 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,871 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778180956]
[2020-10-16 01:39:31,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:31,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:31,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:31,925 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778180956]
[2020-10-16 01:39:31,925 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:31,925 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:31,925 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835864915]
[2020-10-16 01:39:31,926 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:31,926 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:31,926 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:31,926 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:31,928 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169
[2020-10-16 01:39:31,929 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 74 flow. Second operand 5 states.
[2020-10-16 01:39:31,929 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:31,929 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169
[2020-10-16 01:39:31,929 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:31,971 INFO  L129       PetriNetUnfolder]: 1/30 cut-off events.
[2020-10-16 01:39:31,971 INFO  L130       PetriNetUnfolder]: For 27/28 co-relation queries the response was YES.
[2020-10-16 01:39:31,972 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 77 conditions, 30 events. 1/30 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. 
[2020-10-16 01:39:31,972 INFO  L132   encePairwiseOnDemand]: 164/169 looper letters, 2 selfloop transitions, 3 changer transitions 4/25 dead transitions.
[2020-10-16 01:39:31,972 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 117 flow
[2020-10-16 01:39:31,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:31,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:31,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions.
[2020-10-16 01:39:31,975 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8096646942800789
[2020-10-16 01:39:31,975 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 821 transitions.
[2020-10-16 01:39:31,976 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 821 transitions.
[2020-10-16 01:39:31,976 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:31,976 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 821 transitions.
[2020-10-16 01:39:31,978 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:31,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:31,980 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:31,980 INFO  L185             Difference]: Start difference. First operand has 39 places, 21 transitions, 74 flow. Second operand 6 states and 821 transitions.
[2020-10-16 01:39:31,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 117 flow
[2020-10-16 01:39:31,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 93 flow, removed 8 selfloop flow, removed 6 redundant places.
[2020-10-16 01:39:31,982 INFO  L241             Difference]: Finished difference. Result has 40 places, 21 transitions, 76 flow
[2020-10-16 01:39:31,982 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=21}
[2020-10-16 01:39:31,982 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2020-10-16 01:39:31,982 INFO  L481      AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 76 flow
[2020-10-16 01:39:31,982 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:31,983 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:31,983 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:31,983 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:39:31,983 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:31,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:31,984 INFO  L82        PathProgramCache]: Analyzing trace with hash 52429360, now seen corresponding path program 1 times
[2020-10-16 01:39:31,984 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:31,984 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43316359]
[2020-10-16 01:39:31,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:32,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:32,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:32,056 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43316359]
[2020-10-16 01:39:32,056 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:32,056 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:32,056 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039913528]
[2020-10-16 01:39:32,057 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:32,057 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:32,057 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:32,058 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:32,059 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 169
[2020-10-16 01:39:32,059 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 76 flow. Second operand 4 states.
[2020-10-16 01:39:32,060 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:32,060 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 169
[2020-10-16 01:39:32,060 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:32,106 INFO  L129       PetriNetUnfolder]: 28/81 cut-off events.
[2020-10-16 01:39:32,107 INFO  L130       PetriNetUnfolder]: For 36/37 co-relation queries the response was YES.
[2020-10-16 01:39:32,107 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 81 events. 28/81 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 276 event pairs, 12 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 177. Up to 45 conditions per place. 
[2020-10-16 01:39:32,108 INFO  L132   encePairwiseOnDemand]: 163/169 looper letters, 5 selfloop transitions, 4 changer transitions 7/31 dead transitions.
[2020-10-16 01:39:32,108 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 128 flow
[2020-10-16 01:39:32,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:32,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:32,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions.
[2020-10-16 01:39:32,111 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8319526627218935
[2020-10-16 01:39:32,111 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 703 transitions.
[2020-10-16 01:39:32,111 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions.
[2020-10-16 01:39:32,112 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:32,112 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions.
[2020-10-16 01:39:32,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:32,115 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:32,115 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:32,115 INFO  L185             Difference]: Start difference. First operand has 40 places, 21 transitions, 76 flow. Second operand 5 states and 703 transitions.
[2020-10-16 01:39:32,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 128 flow
[2020-10-16 01:39:32,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 106 flow, removed 5 selfloop flow, removed 8 redundant places.
[2020-10-16 01:39:32,117 INFO  L241             Difference]: Finished difference. Result has 37 places, 24 transitions, 90 flow
[2020-10-16 01:39:32,117 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=24}
[2020-10-16 01:39:32,118 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places.
[2020-10-16 01:39:32,118 INFO  L481      AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 90 flow
[2020-10-16 01:39:32,118 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:32,118 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:32,118 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:32,118 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:39:32,119 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:32,119 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:32,119 INFO  L82        PathProgramCache]: Analyzing trace with hash 1084911350, now seen corresponding path program 1 times
[2020-10-16 01:39:32,119 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:32,119 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68248481]
[2020-10-16 01:39:32,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:32,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:32,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:32,196 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68248481]
[2020-10-16 01:39:32,196 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:32,196 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:39:32,197 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55296702]
[2020-10-16 01:39:32,197 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:32,197 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:32,197 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:32,198 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:32,199 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 169
[2020-10-16 01:39:32,200 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 90 flow. Second operand 5 states.
[2020-10-16 01:39:32,200 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:32,200 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 169
[2020-10-16 01:39:32,200 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:32,246 INFO  L129       PetriNetUnfolder]: 16/60 cut-off events.
[2020-10-16 01:39:32,246 INFO  L130       PetriNetUnfolder]: For 44/62 co-relation queries the response was YES.
[2020-10-16 01:39:32,247 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 188 conditions, 60 events. 16/60 cut-off events. For 44/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 2 based on Foata normal form. 13/72 useless extension candidates. Maximal degree in co-relation 176. Up to 35 conditions per place. 
[2020-10-16 01:39:32,247 INFO  L132   encePairwiseOnDemand]: 163/169 looper letters, 5 selfloop transitions, 7 changer transitions 7/34 dead transitions.
[2020-10-16 01:39:32,247 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 186 flow
[2020-10-16 01:39:32,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:32,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:32,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions.
[2020-10-16 01:39:32,251 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8313609467455622
[2020-10-16 01:39:32,251 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 843 transitions.
[2020-10-16 01:39:32,251 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions.
[2020-10-16 01:39:32,252 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:32,252 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions.
[2020-10-16 01:39:32,253 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:32,255 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:32,255 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:32,255 INFO  L185             Difference]: Start difference. First operand has 37 places, 24 transitions, 90 flow. Second operand 6 states and 843 transitions.
[2020-10-16 01:39:32,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 186 flow
[2020-10-16 01:39:32,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:32,258 INFO  L241             Difference]: Finished difference. Result has 41 places, 27 transitions, 140 flow
[2020-10-16 01:39:32,258 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=41, PETRI_TRANSITIONS=27}
[2020-10-16 01:39:32,258 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places.
[2020-10-16 01:39:32,259 INFO  L481      AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 140 flow
[2020-10-16 01:39:32,259 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:32,259 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:32,259 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:32,259 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:39:32,259 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:32,260 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:32,260 INFO  L82        PathProgramCache]: Analyzing trace with hash -1463401110, now seen corresponding path program 1 times
[2020-10-16 01:39:32,260 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:32,260 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483423357]
[2020-10-16 01:39:32,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:32,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:32,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:32,365 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483423357]
[2020-10-16 01:39:32,365 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:32,365 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:39:32,365 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967201734]
[2020-10-16 01:39:32,366 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:39:32,366 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:32,366 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:39:32,367 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:39:32,370 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 169
[2020-10-16 01:39:32,371 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 140 flow. Second operand 6 states.
[2020-10-16 01:39:32,371 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:32,371 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 169
[2020-10-16 01:39:32,371 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:32,429 INFO  L129       PetriNetUnfolder]: 7/36 cut-off events.
[2020-10-16 01:39:32,430 INFO  L130       PetriNetUnfolder]: For 75/93 co-relation queries the response was YES.
[2020-10-16 01:39:32,430 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 142 conditions, 36 events. 7/36 cut-off events. For 75/93 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 12/47 useless extension candidates. Maximal degree in co-relation 127. Up to 20 conditions per place. 
[2020-10-16 01:39:32,430 INFO  L132   encePairwiseOnDemand]: 163/169 looper letters, 2 selfloop transitions, 10 changer transitions 4/31 dead transitions.
[2020-10-16 01:39:32,431 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 208 flow
[2020-10-16 01:39:32,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:39:32,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:39:32,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 977 transitions.
[2020-10-16 01:39:32,434 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8258664412510567
[2020-10-16 01:39:32,434 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 977 transitions.
[2020-10-16 01:39:32,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 977 transitions.
[2020-10-16 01:39:32,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:32,435 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 977 transitions.
[2020-10-16 01:39:32,437 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:39:32,439 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:39:32,439 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:39:32,439 INFO  L185             Difference]: Start difference. First operand has 41 places, 27 transitions, 140 flow. Second operand 7 states and 977 transitions.
[2020-10-16 01:39:32,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 208 flow
[2020-10-16 01:39:32,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 168 flow, removed 15 selfloop flow, removed 5 redundant places.
[2020-10-16 01:39:32,442 INFO  L241             Difference]: Finished difference. Result has 43 places, 27 transitions, 138 flow
[2020-10-16 01:39:32,442 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=27}
[2020-10-16 01:39:32,443 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places.
[2020-10-16 01:39:32,443 INFO  L481      AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 138 flow
[2020-10-16 01:39:32,443 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:39:32,443 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:32,443 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]
[2020-10-16 01:39:32,443 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:39:32,444 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:32,444 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:32,444 INFO  L82        PathProgramCache]: Analyzing trace with hash -1992687787, now seen corresponding path program 1 times
[2020-10-16 01:39:32,444 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:32,444 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981682600]
[2020-10-16 01:39:32,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:32,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:32,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:39:32,729 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981682600]
[2020-10-16 01:39:32,729 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:32,729 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:39:32,730 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324645257]
[2020-10-16 01:39:32,731 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 01:39:32,731 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:32,731 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 01:39:32,732 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-10-16 01:39:32,736 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 169
[2020-10-16 01:39:32,737 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 138 flow. Second operand 8 states.
[2020-10-16 01:39:32,737 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:32,737 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 169
[2020-10-16 01:39:32,737 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:32,962 INFO  L129       PetriNetUnfolder]: 25/86 cut-off events.
[2020-10-16 01:39:32,962 INFO  L130       PetriNetUnfolder]: For 151/160 co-relation queries the response was YES.
[2020-10-16 01:39:32,963 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 299 conditions, 86 events. 25/86 cut-off events. For 151/160 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 301 event pairs, 0 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 284. Up to 43 conditions per place. 
[2020-10-16 01:39:32,963 INFO  L132   encePairwiseOnDemand]: 161/169 looper letters, 6 selfloop transitions, 7 changer transitions 5/37 dead transitions.
[2020-10-16 01:39:32,963 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 212 flow
[2020-10-16 01:39:32,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:39:32,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:39:32,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1036 transitions.
[2020-10-16 01:39:32,968 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.6811308349769888
[2020-10-16 01:39:32,968 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1036 transitions.
[2020-10-16 01:39:32,968 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1036 transitions.
[2020-10-16 01:39:32,969 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:32,969 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1036 transitions.
[2020-10-16 01:39:32,972 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:39:32,975 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:39:32,975 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:39:32,975 INFO  L185             Difference]: Start difference. First operand has 43 places, 27 transitions, 138 flow. Second operand 9 states and 1036 transitions.
[2020-10-16 01:39:32,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 212 flow
[2020-10-16 01:39:32,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 156 flow, removed 21 selfloop flow, removed 6 redundant places.
[2020-10-16 01:39:32,979 INFO  L241             Difference]: Finished difference. Result has 47 places, 30 transitions, 134 flow
[2020-10-16 01:39:32,979 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=30}
[2020-10-16 01:39:32,979 INFO  L342   CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places.
[2020-10-16 01:39:32,980 INFO  L481      AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 134 flow
[2020-10-16 01:39:32,980 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 01:39:32,980 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:32,980 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]
[2020-10-16 01:39:32,980 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:39:32,981 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:32,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:32,981 INFO  L82        PathProgramCache]: Analyzing trace with hash -953123845, now seen corresponding path program 2 times
[2020-10-16 01:39:32,981 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:32,981 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332480356]
[2020-10-16 01:39:32,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:33,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:39:33,023 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:39:33,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:39:33,066 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:39:33,110 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:39:33,111 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:39:33,111 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:39:33,139 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,139 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,144 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,145 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,145 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,145 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,145 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,145 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,146 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,146 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,146 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,147 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,147 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,147 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,147 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,147 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,148 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,148 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,148 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,149 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,149 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,149 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,149 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,149 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,150 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,150 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,150 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,150 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,150 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,150 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,151 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,151 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,151 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,151 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,155 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,155 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,156 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,156 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,156 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,156 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,157 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,157 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,157 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,157 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,158 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,158 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,158 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,158 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,159 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,159 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,159 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,159 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,160 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:39:33,160 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:33,256 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:39:33 BasicIcfg
[2020-10-16 01:39:33,256 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:39:33,258 INFO  L168              Benchmark]: Toolchain (without parser) took 8763.35 ms. Allocated memory was 254.3 MB in the beginning and 514.9 MB in the end (delta: 260.6 MB). Free memory was 209.6 MB in the beginning and 173.8 MB in the end (delta: 35.8 MB). Peak memory consumption was 296.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,258 INFO  L168              Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,259 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 663.40 ms. Allocated memory was 254.3 MB in the beginning and 321.4 MB in the end (delta: 67.1 MB). Free memory was 209.6 MB in the beginning and 272.1 MB in the end (delta: -62.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,260 INFO  L168              Benchmark]: Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 321.4 MB. Free memory was 272.1 MB in the beginning and 269.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,261 INFO  L168              Benchmark]: Boogie Preprocessor took 36.05 ms. Allocated memory is still 321.4 MB. Free memory was 269.6 MB in the beginning and 267.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,262 INFO  L168              Benchmark]: RCFGBuilder took 1835.23 ms. Allocated memory was 321.4 MB in the beginning and 362.8 MB in the end (delta: 41.4 MB). Free memory was 267.1 MB in the beginning and 217.4 MB in the end (delta: 49.7 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,263 INFO  L168              Benchmark]: TraceAbstraction took 6162.02 ms. Allocated memory was 362.8 MB in the beginning and 514.9 MB in the end (delta: 152.0 MB). Free memory was 214.1 MB in the beginning and 173.8 MB in the end (delta: 40.3 MB). Peak memory consumption was 192.3 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:33,267 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.37 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 663.40 ms. Allocated memory was 254.3 MB in the beginning and 321.4 MB in the end (delta: 67.1 MB). Free memory was 209.6 MB in the beginning and 272.1 MB in the end (delta: -62.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 321.4 MB. Free memory was 272.1 MB in the beginning and 269.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 36.05 ms. Allocated memory is still 321.4 MB. Free memory was 269.6 MB in the beginning and 267.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1835.23 ms. Allocated memory was 321.4 MB in the beginning and 362.8 MB in the end (delta: 41.4 MB). Free memory was 267.1 MB in the beginning and 217.4 MB in the end (delta: 49.7 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 6162.02 ms. Allocated memory was 362.8 MB in the beginning and 514.9 MB in the end (delta: 152.0 MB). Free memory was 214.1 MB in the beginning and 173.8 MB in the end (delta: 40.3 MB). Peak memory consumption was 192.3 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1068 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 136 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 98 PlacesBefore, 33 PlacesAfterwards, 90 TransitionsBefore, 24 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 3795 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p0_EBX = 0;
[L705]               0  int __unbuffered_p2_EAX = 0;
[L706]               0  _Bool main$tmp_guard0;
[L707]               0  _Bool main$tmp_guard1;
[L709]               0  int x = 0;
[L710]               0  _Bool x$flush_delayed;
[L711]               0  int x$mem_tmp;
[L712]               0  _Bool x$r_buff0_thd0;
[L713]               0  _Bool x$r_buff0_thd1;
[L714]               0  _Bool x$r_buff0_thd2;
[L715]               0  _Bool x$r_buff0_thd3;
[L716]               0  _Bool x$r_buff1_thd0;
[L717]               0  _Bool x$r_buff1_thd1;
[L718]               0  _Bool x$r_buff1_thd2;
[L719]               0  _Bool x$r_buff1_thd3;
[L720]               0  _Bool x$read_delayed;
[L721]               0  int *x$read_delayed_var;
[L722]               0  int x$w_buff0;
[L723]               0  _Bool x$w_buff0_used;
[L724]               0  int x$w_buff1;
[L725]               0  _Bool x$w_buff1_used;
[L727]               0  int y = 0;
[L729]               0  int z = 0;
[L730]               0  _Bool weak$$choice0;
[L731]               0  _Bool weak$$choice2;
[L820]               0  pthread_t t2064;
[L821]  FCALL, FORK  0  pthread_create(&t2064, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L822]               0  pthread_t t2065;
[L823]  FCALL, FORK  0  pthread_create(&t2065, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L763]               2  x$w_buff1 = x$w_buff0
[L764]               2  x$w_buff0 = 1
[L765]               2  x$w_buff1_used = x$w_buff0_used
[L766]               2  x$w_buff0_used = (_Bool)1
[L8]    COND TRUE    2  !expression
[L8]                 2  __VERIFIER_error()
[L768]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L769]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L770]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L771]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L772]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L775]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L824]               0  pthread_t t2066;
[L825]  FCALL, FORK  0  pthread_create(&t2066, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L792]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L795]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L735]               1  __unbuffered_p0_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L738]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L739]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L740]               1  x$flush_delayed = weak$$choice2
[L741]               1  x$mem_tmp = x
[L742]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1
[L742]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L743]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L743]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L744]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L745]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L745]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L746]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L746]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L747]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L748]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L749]               1  __unbuffered_p0_EBX = x
[L750]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L750]               1  x = x$flush_delayed ? x$mem_tmp : x
[L751]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L799]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L799]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L800]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L800]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L801]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L801]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L802]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L802]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L785]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L787]               2  return 0;
[L805]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L807]               3  return 0;
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L758]               1  return 0;
[L827]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L831]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L831]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L831]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L831]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L832]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L832]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L833]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L833]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L834]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L834]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L835]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L835]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L838]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 38 SDtfs, 26 SDslu, 43 SDs, 0 SdLazy, 201 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 8600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...