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


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


This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239
[2021-03-24 19:36:09,784 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-03-24 19:36:09,789 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-24 19:36:09,826 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-24 19:36:09,827 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-24 19:36:09,830 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-24 19:36:09,833 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-24 19:36:09,839 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-24 19:36:09,841 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-24 19:36:09,845 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-24 19:36:09,846 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-03-24 19:36:09,846 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-24 19:36:09,847 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-24 19:36:09,847 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-24 19:36:09,848 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-24 19:36:09,849 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-24 19:36:09,849 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-24 19:36:09,850 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-24 19:36:09,851 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-24 19:36:09,853 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-24 19:36:09,854 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-24 19:36:09,855 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-24 19:36:09,856 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-03-24 19:36:09,856 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-24 19:36:09,858 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-24 19:36:09,859 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-24 19:36:09,859 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-24 19:36:09,860 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-24 19:36:09,860 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-24 19:36:09,861 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-24 19:36:09,861 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-24 19:36:09,862 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-24 19:36:09,862 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-24 19:36:09,863 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-24 19:36:09,864 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-24 19:36:09,864 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-24 19:36:09,865 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-24 19:36:09,865 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-24 19:36:09,865 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-24 19:36:09,866 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-24 19:36:09,866 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-03-24 19:36:09,867 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2021-03-24 19:36:09,900 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-03-24 19:36:09,900 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-24 19:36:09,902 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-24 19:36:09,902 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-03-24 19:36:09,902 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-03-24 19:36:09,902 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-24 19:36:09,902 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-03-24 19:36:09,902 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-03-24 19:36:09,902 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-03-24 19:36:09,903 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-03-24 19:36:09,904 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-24 19:36:09,904 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-03-24 19:36:09,904 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-03-24 19:36:09,904 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-03-24 19:36:09,904 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-24 19:36:09,905 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-24 19:36:09,905 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-03-24 19:36:10,167 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-24 19:36:10,183 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-24 19:36:10,185 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-24 19:36:10,186 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-03-24 19:36:10,187 INFO  L275        PluginConnector]: CDTParser initialized
[2021-03-24 19:36:10,188 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i
[2021-03-24 19:36:10,247 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572f28699/2cc3311b0c92448fb34a224142e71325/FLAGd7141fb73
[2021-03-24 19:36:10,728 INFO  L306              CDTParser]: Found 1 translation units.
[2021-03-24 19:36:10,729 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i
[2021-03-24 19:36:10,745 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572f28699/2cc3311b0c92448fb34a224142e71325/FLAGd7141fb73
[2021-03-24 19:36:10,772 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572f28699/2cc3311b0c92448fb34a224142e71325
[2021-03-24 19:36:10,777 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-24 19:36:10,779 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-24 19:36:10,781 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-24 19:36:10,782 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-24 19:36:10,785 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-24 19:36:10,785 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:36:10" (1/1) ...
[2021-03-24 19:36:10,787 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b067d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:10, skipping insertion in model container
[2021-03-24 19:36:10,787 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:36:10" (1/1) ...
[2021-03-24 19:36:10,797 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-03-24 19:36:10,845 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-03-24 19:36:11,026 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i[949,962]
[2021-03-24 19:36:11,224 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-24 19:36:11,240 INFO  L203         MainTranslator]: Completed pre-run
[2021-03-24 19:36:11,250 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i[949,962]
[2021-03-24 19:36:11,309 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-24 19:36:11,385 INFO  L208         MainTranslator]: Completed translation
[2021-03-24 19:36:11,385 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11 WrapperNode
[2021-03-24 19:36:11,388 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-24 19:36:11,389 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-24 19:36:11,389 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-24 19:36:11,390 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-24 19:36:11,397 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,429 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,470 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-24 19:36:11,471 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-24 19:36:11,471 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-24 19:36:11,471 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-03-24 19:36:11,479 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,479 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,482 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,483 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,491 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,497 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,500 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
[2021-03-24 19:36:11,504 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-24 19:36:11,505 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-24 19:36:11,505 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-03-24 19:36:11,505 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-03-24 19:36:11,506 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-24 19:36:11,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-03-24 19:36:11,589 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-24 19:36:11,590 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-24 19:36:11,590 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-24 19:36:11,590 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-03-24 19:36:11,591 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-03-24 19:36:11,591 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-03-24 19:36:11,591 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-03-24 19:36:11,592 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-03-24 19:36:11,592 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-03-24 19:36:11,592 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-24 19:36:11,592 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-24 19:36:11,592 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-24 19:36:11,593 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-24 19:36:11,594 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-24 19:36:13,832 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-24 19:36:13,832 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-03-24 19:36:13,834 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:36:13 BoogieIcfgContainer
[2021-03-24 19:36:13,834 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-24 19:36:13,836 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-24 19:36:13,836 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-03-24 19:36:13,838 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-03-24 19:36:13,838 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 07:36:10" (1/3) ...
[2021-03-24 19:36:13,839 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1823f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:36:13, skipping insertion in model container
[2021-03-24 19:36:13,839 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:36:11" (2/3) ...
[2021-03-24 19:36:13,839 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1823f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:36:13, skipping insertion in model container
[2021-03-24 19:36:13,839 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:36:13" (3/3) ...
[2021-03-24 19:36:13,840 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix028_tso.oepc.i
[2021-03-24 19:36:13,846 INFO  L149   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-24 19:36:13,851 INFO  L161   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-03-24 19:36:13,851 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-24 19:36:13,908 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,908 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,908 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,908 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,910 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,914 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,919 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,920 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,922 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,923 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,924 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,930 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,930 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,930 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,930 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,932 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,932 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,932 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,932 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,934 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,934 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,934 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,934 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,934 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,935 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,935 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,935 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,935 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,935 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,938 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,939 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,940 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,941 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,941 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,941 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,941 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-24 19:36:13,942 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-24 19:36:13,959 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-03-24 19:36:13,976 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-03-24 19:36:13,976 INFO  L377      AbstractCegarLoop]: Hoare is false
[2021-03-24 19:36:13,976 INFO  L378      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-24 19:36:13,977 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-24 19:36:13,977 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-24 19:36:13,977 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-03-24 19:36:13,977 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-24 19:36:13,977 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-24 19:36:13,986 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow
[2021-03-24 19:36:14,017 INFO  L129       PetriNetUnfolder]: 2/95 cut-off events.
[2021-03-24 19:36:14,017 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-24 19:36:14,020 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2021-03-24 19:36:14,020 INFO  L82        GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow
[2021-03-24 19:36:14,024 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow
[2021-03-24 19:36:14,025 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-24 19:36:14,035 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow
[2021-03-24 19:36:14,037 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow
[2021-03-24 19:36:14,039 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow
[2021-03-24 19:36:14,054 INFO  L129       PetriNetUnfolder]: 2/95 cut-off events.
[2021-03-24 19:36:14,054 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-24 19:36:14,055 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2021-03-24 19:36:14,057 INFO  L142        LiptonReduction]: Number of co-enabled transitions 1658
[2021-03-24 19:36:15,577 WARN  L205               SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187
[2021-03-24 19:36:15,910 WARN  L205               SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 185
[2021-03-24 19:36:17,291 WARN  L205               SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 312 DAG size of output: 268
[2021-03-24 19:36:17,860 WARN  L205               SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 265
[2021-03-24 19:36:18,550 WARN  L205               SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-03-24 19:36:19,031 WARN  L205               SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88
[2021-03-24 19:36:19,196 WARN  L205               SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2021-03-24 19:36:20,502 WARN  L205               SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 187
[2021-03-24 19:36:20,779 WARN  L205               SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 187
[2021-03-24 19:36:21,381 WARN  L205               SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 267
[2021-03-24 19:36:22,032 WARN  L205               SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 267
[2021-03-24 19:36:22,209 INFO  L154        LiptonReduction]: Checked pairs total: 3000
[2021-03-24 19:36:22,209 INFO  L156        LiptonReduction]: Total number of compositions: 66
[2021-03-24 19:36:22,211 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8187
[2021-03-24 19:36:22,219 INFO  L129       PetriNetUnfolder]: 0/19 cut-off events.
[2021-03-24 19:36:22,219 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-24 19:36:22,219 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:22,220 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:22,220 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:22,224 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:22,224 INFO  L82        PathProgramCache]: Analyzing trace with hash -1761882991, now seen corresponding path program 1 times
[2021-03-24 19:36:22,231 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:22,231 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557502087]
[2021-03-24 19:36:22,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:22,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:22,427 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:22,428 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:22,429 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:22,429 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:22,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:22,436 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557502087]
[2021-03-24 19:36:22,436 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:22,436 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-24 19:36:22,437 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761098159]
[2021-03-24 19:36:22,444 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-24 19:36:22,444 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:22,454 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-24 19:36:22,455 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-24 19:36:22,456 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164
[2021-03-24 19:36:22,459 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand  has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,459 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:22,459 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164
[2021-03-24 19:36:22,460 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:22,554 INFO  L129       PetriNetUnfolder]: 33/111 cut-off events.
[2021-03-24 19:36:22,554 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-24 19:36:22,555 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 111 events. 33/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 426 event pairs, 3 based on Foata normal form. 7/108 useless extension candidates. Maximal degree in co-relation 169. Up to 55 conditions per place. 
[2021-03-24 19:36:22,556 INFO  L132   encePairwiseOnDemand]: 160/164 looper letters, 8 selfloop transitions, 2 changer transitions 5/39 dead transitions.
[2021-03-24 19:36:22,556 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 111 flow
[2021-03-24 19:36:22,557 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-24 19:36:22,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-24 19:36:22,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions.
[2021-03-24 19:36:22,573 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8902439024390244
[2021-03-24 19:36:22,574 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 438 transitions.
[2021-03-24 19:36:22,574 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions.
[2021-03-24 19:36:22,577 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:22,579 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions.
[2021-03-24 19:36:22,583 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,592 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,593 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,595 INFO  L185             Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 438 transitions.
[2021-03-24 19:36:22,596 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 111 flow
[2021-03-24 19:36:22,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-24 19:36:22,600 INFO  L241             Difference]: Finished difference. Result has 44 places, 31 transitions, 72 flow
[2021-03-24 19:36:22,601 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=31}
[2021-03-24 19:36:22,602 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places.
[2021-03-24 19:36:22,602 INFO  L480      AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 72 flow
[2021-03-24 19:36:22,603 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,603 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:22,603 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:22,603 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-24 19:36:22,603 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:22,604 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:22,605 INFO  L82        PathProgramCache]: Analyzing trace with hash 541907453, now seen corresponding path program 1 times
[2021-03-24 19:36:22,605 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:22,605 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741703997]
[2021-03-24 19:36:22,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:22,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:22,769 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:22,769 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:22,770 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:22,770 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:22,779 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-24 19:36:22,779 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:22,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:22,783 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741703997]
[2021-03-24 19:36:22,783 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:22,783 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-24 19:36:22,784 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182385042]
[2021-03-24 19:36:22,785 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-24 19:36:22,785 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:22,792 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-24 19:36:22,793 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-24 19:36:22,794 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 164
[2021-03-24 19:36:22,795 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 72 flow. Second operand  has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,795 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:22,795 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 164
[2021-03-24 19:36:22,795 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:22,833 INFO  L129       PetriNetUnfolder]: 0/36 cut-off events.
[2021-03-24 19:36:22,833 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-24 19:36:22,833 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. 
[2021-03-24 19:36:22,834 INFO  L132   encePairwiseOnDemand]: 160/164 looper letters, 2 selfloop transitions, 2 changer transitions 3/33 dead transitions.
[2021-03-24 19:36:22,834 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 88 flow
[2021-03-24 19:36:22,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-24 19:36:22,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-24 19:36:22,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions.
[2021-03-24 19:36:22,836 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8939024390243903
[2021-03-24 19:36:22,836 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 733 transitions.
[2021-03-24 19:36:22,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions.
[2021-03-24 19:36:22,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:22,837 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions.
[2021-03-24 19:36:22,838 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,841 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,841 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,841 INFO  L185             Difference]: Start difference. First operand has 44 places, 31 transitions, 72 flow. Second operand 5 states and 733 transitions.
[2021-03-24 19:36:22,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 88 flow
[2021-03-24 19:36:22,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 33 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-24 19:36:22,843 INFO  L241             Difference]: Finished difference. Result has 45 places, 30 transitions, 78 flow
[2021-03-24 19:36:22,844 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=30}
[2021-03-24 19:36:22,844 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places.
[2021-03-24 19:36:22,845 INFO  L480      AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 78 flow
[2021-03-24 19:36:22,845 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:22,845 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:22,845 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:22,845 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-24 19:36:22,845 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:22,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:22,846 INFO  L82        PathProgramCache]: Analyzing trace with hash 1081831399, now seen corresponding path program 1 times
[2021-03-24 19:36:22,846 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:22,846 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784315566]
[2021-03-24 19:36:22,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:22,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:23,003 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,004 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,004 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,004 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,008 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-24 19:36:23,010 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:23,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:23,014 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784315566]
[2021-03-24 19:36:23,015 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:23,016 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-24 19:36:23,017 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672733326]
[2021-03-24 19:36:23,017 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-24 19:36:23,018 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:23,019 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-24 19:36:23,019 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-24 19:36:23,020 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164
[2021-03-24 19:36:23,020 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 78 flow. Second operand  has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,021 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:23,021 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164
[2021-03-24 19:36:23,021 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:23,065 INFO  L129       PetriNetUnfolder]: 6/56 cut-off events.
[2021-03-24 19:36:23,065 INFO  L130       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2021-03-24 19:36:23,066 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 56 events. 6/56 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 2 based on Foata normal form. 4/58 useless extension candidates. Maximal degree in co-relation 81. Up to 15 conditions per place. 
[2021-03-24 19:36:23,066 INFO  L132   encePairwiseOnDemand]: 159/164 looper letters, 4 selfloop transitions, 3 changer transitions 5/37 dead transitions.
[2021-03-24 19:36:23,066 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 118 flow
[2021-03-24 19:36:23,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-24 19:36:23,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-24 19:36:23,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions.
[2021-03-24 19:36:23,069 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8768292682926829
[2021-03-24 19:36:23,069 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 719 transitions.
[2021-03-24 19:36:23,069 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions.
[2021-03-24 19:36:23,069 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:23,069 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions.
[2021-03-24 19:36:23,071 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,072 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,073 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,073 INFO  L185             Difference]: Start difference. First operand has 45 places, 30 transitions, 78 flow. Second operand 5 states and 719 transitions.
[2021-03-24 19:36:23,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 118 flow
[2021-03-24 19:36:23,074 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 110 flow, removed 2 selfloop flow, removed 4 redundant places.
[2021-03-24 19:36:23,074 INFO  L241             Difference]: Finished difference. Result has 45 places, 32 transitions, 97 flow
[2021-03-24 19:36:23,075 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=45, PETRI_TRANSITIONS=32}
[2021-03-24 19:36:23,075 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places.
[2021-03-24 19:36:23,075 INFO  L480      AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 97 flow
[2021-03-24 19:36:23,075 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,075 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:23,075 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:23,076 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-24 19:36:23,076 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:23,076 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:23,076 INFO  L82        PathProgramCache]: Analyzing trace with hash 1214663507, now seen corresponding path program 1 times
[2021-03-24 19:36:23,076 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:23,076 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706865491]
[2021-03-24 19:36:23,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:23,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:23,240 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,241 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,242 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,243 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,246 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,246 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,249 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,250 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:23,250 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706865491]
[2021-03-24 19:36:23,251 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:23,251 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-24 19:36:23,251 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216970882]
[2021-03-24 19:36:23,251 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-24 19:36:23,251 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:23,252 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-24 19:36:23,252 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-24 19:36:23,253 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2021-03-24 19:36:23,253 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 97 flow. Second operand  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,253 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:23,254 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2021-03-24 19:36:23,254 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:23,312 INFO  L129       PetriNetUnfolder]: 51/144 cut-off events.
[2021-03-24 19:36:23,312 INFO  L130       PetriNetUnfolder]: For 40/40 co-relation queries the response was YES.
[2021-03-24 19:36:23,315 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 315 conditions, 144 events. 51/144 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 640 event pairs, 23 based on Foata normal form. 10/143 useless extension candidates. Maximal degree in co-relation 294. Up to 60 conditions per place. 
[2021-03-24 19:36:23,316 INFO  L132   encePairwiseOnDemand]: 158/164 looper letters, 7 selfloop transitions, 7 changer transitions 2/42 dead transitions.
[2021-03-24 19:36:23,316 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 149 flow
[2021-03-24 19:36:23,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-24 19:36:23,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-24 19:36:23,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions.
[2021-03-24 19:36:23,318 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8512195121951219
[2021-03-24 19:36:23,318 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 698 transitions.
[2021-03-24 19:36:23,318 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions.
[2021-03-24 19:36:23,319 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:23,319 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions.
[2021-03-24 19:36:23,320 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,323 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,323 INFO  L185             Difference]: Start difference. First operand has 45 places, 32 transitions, 97 flow. Second operand 5 states and 698 transitions.
[2021-03-24 19:36:23,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 149 flow
[2021-03-24 19:36:23,324 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 144 flow, removed 1 selfloop flow, removed 2 redundant places.
[2021-03-24 19:36:23,325 INFO  L241             Difference]: Finished difference. Result has 48 places, 38 transitions, 146 flow
[2021-03-24 19:36:23,326 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=38}
[2021-03-24 19:36:23,326 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places.
[2021-03-24 19:36:23,326 INFO  L480      AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 146 flow
[2021-03-24 19:36:23,326 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,326 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:23,326 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:23,327 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-24 19:36:23,327 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:23,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:23,327 INFO  L82        PathProgramCache]: Analyzing trace with hash 286090376, now seen corresponding path program 1 times
[2021-03-24 19:36:23,327 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:23,327 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092612082]
[2021-03-24 19:36:23,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:23,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:23,428 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,429 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,429 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,429 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,437 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-24 19:36:23,438 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:23,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:23,442 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092612082]
[2021-03-24 19:36:23,442 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:23,442 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-24 19:36:23,442 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130329932]
[2021-03-24 19:36:23,443 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-24 19:36:23,443 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:23,443 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-24 19:36:23,447 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-24 19:36:23,448 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164
[2021-03-24 19:36:23,451 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 146 flow. Second operand  has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,451 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:23,451 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164
[2021-03-24 19:36:23,451 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:23,507 INFO  L129       PetriNetUnfolder]: 61/193 cut-off events.
[2021-03-24 19:36:23,507 INFO  L130       PetriNetUnfolder]: For 159/185 co-relation queries the response was YES.
[2021-03-24 19:36:23,510 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 193 events. 61/193 cut-off events. For 159/185 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1013 event pairs, 27 based on Foata normal form. 13/192 useless extension candidates. Maximal degree in co-relation 534. Up to 103 conditions per place. 
[2021-03-24 19:36:23,511 INFO  L132   encePairwiseOnDemand]: 160/164 looper letters, 5 selfloop transitions, 5 changer transitions 3/41 dead transitions.
[2021-03-24 19:36:23,511 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 182 flow
[2021-03-24 19:36:23,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-24 19:36:23,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-24 19:36:23,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions.
[2021-03-24 19:36:23,514 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8731707317073171
[2021-03-24 19:36:23,514 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 716 transitions.
[2021-03-24 19:36:23,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions.
[2021-03-24 19:36:23,514 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:23,514 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions.
[2021-03-24 19:36:23,516 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,518 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,518 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,519 INFO  L185             Difference]: Start difference. First operand has 48 places, 38 transitions, 146 flow. Second operand 5 states and 716 transitions.
[2021-03-24 19:36:23,519 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 182 flow
[2021-03-24 19:36:23,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 174 flow, removed 2 selfloop flow, removed 1 redundant places.
[2021-03-24 19:36:23,522 INFO  L241             Difference]: Finished difference. Result has 54 places, 37 transitions, 155 flow
[2021-03-24 19:36:23,523 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=37}
[2021-03-24 19:36:23,523 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places.
[2021-03-24 19:36:23,523 INFO  L480      AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 155 flow
[2021-03-24 19:36:23,523 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,523 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:23,523 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:23,524 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-24 19:36:23,524 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:23,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:23,524 INFO  L82        PathProgramCache]: Analyzing trace with hash -1423738346, now seen corresponding path program 1 times
[2021-03-24 19:36:23,525 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:23,525 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001098198]
[2021-03-24 19:36:23,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:23,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:23,629 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,630 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,630 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,631 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,637 INFO  L142       QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size
[2021-03-24 19:36:23,637 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:23,642 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,642 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,646 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,647 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:23,648 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001098198]
[2021-03-24 19:36:23,649 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:23,649 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-24 19:36:23,649 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168734719]
[2021-03-24 19:36:23,650 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-24 19:36:23,650 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:23,650 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-24 19:36:23,651 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-24 19:36:23,651 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2021-03-24 19:36:23,652 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 155 flow. Second operand  has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,652 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:23,652 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2021-03-24 19:36:23,653 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:23,708 INFO  L129       PetriNetUnfolder]: 33/124 cut-off events.
[2021-03-24 19:36:23,708 INFO  L130       PetriNetUnfolder]: For 178/215 co-relation queries the response was YES.
[2021-03-24 19:36:23,709 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 427 conditions, 124 events. 33/124 cut-off events. For 178/215 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 487 event pairs, 5 based on Foata normal form. 19/136 useless extension candidates. Maximal degree in co-relation 400. Up to 69 conditions per place. 
[2021-03-24 19:36:23,709 INFO  L132   encePairwiseOnDemand]: 158/164 looper letters, 5 selfloop transitions, 7 changer transitions 9/47 dead transitions.
[2021-03-24 19:36:23,710 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 251 flow
[2021-03-24 19:36:23,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-24 19:36:23,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-24 19:36:23,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions.
[2021-03-24 19:36:23,712 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.850609756097561
[2021-03-24 19:36:23,712 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 837 transitions.
[2021-03-24 19:36:23,712 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions.
[2021-03-24 19:36:23,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:23,713 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions.
[2021-03-24 19:36:23,714 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,716 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,716 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,716 INFO  L185             Difference]: Start difference. First operand has 54 places, 37 transitions, 155 flow. Second operand 6 states and 837 transitions.
[2021-03-24 19:36:23,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 251 flow
[2021-03-24 19:36:23,718 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 240 flow, removed 4 selfloop flow, removed 2 redundant places.
[2021-03-24 19:36:23,719 INFO  L241             Difference]: Finished difference. Result has 58 places, 38 transitions, 186 flow
[2021-03-24 19:36:23,719 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=38}
[2021-03-24 19:36:23,719 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places.
[2021-03-24 19:36:23,720 INFO  L480      AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 186 flow
[2021-03-24 19:36:23,720 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,720 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:23,720 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:23,720 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-24 19:36:23,720 INFO  L428      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:23,721 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:23,721 INFO  L82        PathProgramCache]: Analyzing trace with hash 1409260767, now seen corresponding path program 1 times
[2021-03-24 19:36:23,721 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:23,721 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819921897]
[2021-03-24 19:36:23,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:23,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:23,830 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,831 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:23,832 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,832 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:23,836 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,836 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-24 19:36:23,842 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,844 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-24 19:36:23,855 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,855 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-24 19:36:23,871 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,871 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-24 19:36:23,884 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:23,885 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-24 19:36:23,886 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-24 19:36:23,887 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:23,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:23,894 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819921897]
[2021-03-24 19:36:23,894 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:23,894 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-24 19:36:23,894 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604354985]
[2021-03-24 19:36:23,894 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-24 19:36:23,894 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:23,895 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-24 19:36:23,895 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-03-24 19:36:23,896 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164
[2021-03-24 19:36:23,897 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 186 flow. Second operand  has 8 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:23,897 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:23,897 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164
[2021-03-24 19:36:23,897 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:24,075 INFO  L129       PetriNetUnfolder]: 84/259 cut-off events.
[2021-03-24 19:36:24,075 INFO  L130       PetriNetUnfolder]: For 600/665 co-relation queries the response was YES.
[2021-03-24 19:36:24,076 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 965 conditions, 259 events. 84/259 cut-off events. For 600/665 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1334 event pairs, 9 based on Foata normal form. 19/267 useless extension candidates. Maximal degree in co-relation 933. Up to 115 conditions per place. 
[2021-03-24 19:36:24,079 INFO  L132   encePairwiseOnDemand]: 156/164 looper letters, 11 selfloop transitions, 6 changer transitions 3/47 dead transitions.
[2021-03-24 19:36:24,079 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 263 flow
[2021-03-24 19:36:24,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-24 19:36:24,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-24 19:36:24,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1038 transitions.
[2021-03-24 19:36:24,082 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.7911585365853658
[2021-03-24 19:36:24,082 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1038 transitions.
[2021-03-24 19:36:24,082 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1038 transitions.
[2021-03-24 19:36:24,082 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:24,082 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1038 transitions.
[2021-03-24 19:36:24,084 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 129.75) internal successors, (1038), 8 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,086 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 164.0) internal successors, (1476), 9 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,087 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 164.0) internal successors, (1476), 9 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,087 INFO  L185             Difference]: Start difference. First operand has 58 places, 38 transitions, 186 flow. Second operand 8 states and 1038 transitions.
[2021-03-24 19:36:24,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 263 flow
[2021-03-24 19:36:24,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 221 flow, removed 17 selfloop flow, removed 6 redundant places.
[2021-03-24 19:36:24,092 INFO  L241             Difference]: Finished difference. Result has 58 places, 40 transitions, 184 flow
[2021-03-24 19:36:24,092 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=58, PETRI_TRANSITIONS=40}
[2021-03-24 19:36:24,092 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places.
[2021-03-24 19:36:24,092 INFO  L480      AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 184 flow
[2021-03-24 19:36:24,093 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,093 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:24,093 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:24,093 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-24 19:36:24,093 INFO  L428      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:24,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:24,094 INFO  L82        PathProgramCache]: Analyzing trace with hash 1843712295, now seen corresponding path program 2 times
[2021-03-24 19:36:24,094 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:24,094 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150239378]
[2021-03-24 19:36:24,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:24,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:24,198 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,198 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:24,199 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,199 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,202 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,203 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,209 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,210 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,215 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,217 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,222 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,222 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:24,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:24,223 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150239378]
[2021-03-24 19:36:24,223 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:24,223 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-24 19:36:24,223 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502075478]
[2021-03-24 19:36:24,224 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-24 19:36:24,224 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:24,224 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-24 19:36:24,224 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-24 19:36:24,225 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2021-03-24 19:36:24,226 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 184 flow. Second operand  has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,226 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:24,226 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2021-03-24 19:36:24,226 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:24,295 INFO  L129       PetriNetUnfolder]: 32/130 cut-off events.
[2021-03-24 19:36:24,295 INFO  L130       PetriNetUnfolder]: For 185/267 co-relation queries the response was YES.
[2021-03-24 19:36:24,295 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 440 conditions, 130 events. 32/130 cut-off events. For 185/267 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 514 event pairs, 0 based on Foata normal form. 54/176 useless extension candidates. Maximal degree in co-relation 423. Up to 71 conditions per place. 
[2021-03-24 19:36:24,296 INFO  L132   encePairwiseOnDemand]: 158/164 looper letters, 2 selfloop transitions, 11 changer transitions 5/44 dead transitions.
[2021-03-24 19:36:24,296 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 44 transitions, 246 flow
[2021-03-24 19:36:24,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-24 19:36:24,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-24 19:36:24,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions.
[2021-03-24 19:36:24,299 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8449477351916377
[2021-03-24 19:36:24,299 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 970 transitions.
[2021-03-24 19:36:24,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions.
[2021-03-24 19:36:24,299 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:24,299 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions.
[2021-03-24 19:36:24,301 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 138.57142857142858) internal successors, (970), 7 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,303 INFO  L185             Difference]: Start difference. First operand has 58 places, 40 transitions, 184 flow. Second operand 7 states and 970 transitions.
[2021-03-24 19:36:24,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 44 transitions, 246 flow
[2021-03-24 19:36:24,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 208 flow, removed 13 selfloop flow, removed 8 redundant places.
[2021-03-24 19:36:24,308 INFO  L241             Difference]: Finished difference. Result has 57 places, 39 transitions, 184 flow
[2021-03-24 19:36:24,308 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=57, PETRI_TRANSITIONS=39}
[2021-03-24 19:36:24,308 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places.
[2021-03-24 19:36:24,308 INFO  L480      AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 184 flow
[2021-03-24 19:36:24,309 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,309 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:24,309 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:24,309 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-24 19:36:24,309 INFO  L428      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:24,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:24,309 INFO  L82        PathProgramCache]: Analyzing trace with hash 2067079026, now seen corresponding path program 1 times
[2021-03-24 19:36:24,309 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:24,310 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456507667]
[2021-03-24 19:36:24,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:24,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-24 19:36:24,397 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,398 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-24 19:36:24,398 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,399 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,402 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-24 19:36:24,402 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-24 19:36:24,407 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-24 19:36:24,407 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-24 19:36:24,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-24 19:36:24,413 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456507667]
[2021-03-24 19:36:24,414 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-24 19:36:24,414 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-24 19:36:24,414 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294550453]
[2021-03-24 19:36:24,414 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-24 19:36:24,414 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-24 19:36:24,414 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-24 19:36:24,414 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-24 19:36:24,415 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164
[2021-03-24 19:36:24,416 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 184 flow. Second operand  has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,416 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-24 19:36:24,416 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164
[2021-03-24 19:36:24,416 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-24 19:36:24,456 INFO  L129       PetriNetUnfolder]: 22/114 cut-off events.
[2021-03-24 19:36:24,457 INFO  L130       PetriNetUnfolder]: For 166/189 co-relation queries the response was YES.
[2021-03-24 19:36:24,457 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 376 conditions, 114 events. 22/114 cut-off events. For 166/189 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 413 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 347. Up to 56 conditions per place. 
[2021-03-24 19:36:24,457 INFO  L132   encePairwiseOnDemand]: 160/164 looper letters, 5 selfloop transitions, 1 changer transitions 5/41 dead transitions.
[2021-03-24 19:36:24,458 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 41 transitions, 208 flow
[2021-03-24 19:36:24,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-24 19:36:24,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-24 19:36:24,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions.
[2021-03-24 19:36:24,460 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8707317073170732
[2021-03-24 19:36:24,460 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 714 transitions.
[2021-03-24 19:36:24,460 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 714 transitions.
[2021-03-24 19:36:24,460 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-24 19:36:24,460 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 714 transitions.
[2021-03-24 19:36:24,462 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,464 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,464 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,464 INFO  L185             Difference]: Start difference. First operand has 57 places, 39 transitions, 184 flow. Second operand 5 states and 714 transitions.
[2021-03-24 19:36:24,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 41 transitions, 208 flow
[2021-03-24 19:36:24,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 164 flow, removed 12 selfloop flow, removed 8 redundant places.
[2021-03-24 19:36:24,466 INFO  L241             Difference]: Finished difference. Result has 55 places, 36 transitions, 137 flow
[2021-03-24 19:36:24,467 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=55, PETRI_TRANSITIONS=36}
[2021-03-24 19:36:24,467 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places.
[2021-03-24 19:36:24,467 INFO  L480      AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 137 flow
[2021-03-24 19:36:24,467 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-24 19:36:24,467 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-24 19:36:24,468 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-24 19:36:24,468 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-24 19:36:24,468 INFO  L428      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-24 19:36:24,468 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-24 19:36:24,468 INFO  L82        PathProgramCache]: Analyzing trace with hash -1833054218, now seen corresponding path program 2 times
[2021-03-24 19:36:24,469 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-24 19:36:24,469 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268138578]
[2021-03-24 19:36:24,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-24 19:36:24,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-24 19:36:24,516 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-24 19:36:24,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-24 19:36:24,596 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-24 19:36:24,624 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-24 19:36:24,625 INFO  L634         BasicCegarLoop]: Counterexample might be feasible
[2021-03-24 19:36:24,625 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-24 19:36:24,700 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 07:36:24 BasicIcfg
[2021-03-24 19:36:24,700 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-24 19:36:24,701 INFO  L168              Benchmark]: Toolchain (without parser) took 13922.39 ms. Allocated memory was 255.9 MB in the beginning and 515.9 MB in the end (delta: 260.0 MB). Free memory was 235.5 MB in the beginning and 330.6 MB in the end (delta: -95.1 MB). Peak memory consumption was 164.4 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,701 INFO  L168              Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,702 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 606.78 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 235.0 MB in the beginning and 302.3 MB in the end (delta: -67.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,702 INFO  L168              Benchmark]: Boogie Procedure Inliner took 81.87 ms. Allocated memory is still 343.9 MB. Free memory was 302.3 MB in the beginning and 299.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,702 INFO  L168              Benchmark]: Boogie Preprocessor took 32.96 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 296.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,703 INFO  L168              Benchmark]: RCFGBuilder took 2329.33 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 296.3 MB in the beginning and 293.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 75.4 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,703 INFO  L168              Benchmark]: TraceAbstraction took 10864.98 ms. Allocated memory was 413.1 MB in the beginning and 515.9 MB in the end (delta: 102.8 MB). Free memory was 292.6 MB in the beginning and 330.6 MB in the end (delta: -38.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 16.0 GB.
[2021-03-24 19:36:24,705 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 606.78 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 235.0 MB in the beginning and 302.3 MB in the end (delta: -67.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 81.87 ms. Allocated memory is still 343.9 MB. Free memory was 302.3 MB in the beginning and 299.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 32.96 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 296.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2329.33 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 296.3 MB in the beginning and 293.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 75.4 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 10864.98 ms. Allocated memory was 413.1 MB in the beginning and 515.9 MB in the end (delta: 102.8 MB). Free memory was 292.6 MB in the beginning and 330.6 MB in the end (delta: -38.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 8172.1ms, 103 PlacesBefore, 47 PlacesAfterwards, 95 TransitionsBefore, 38 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1472, positive: 1389, positive conditional: 0, positive unconditional: 1389, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, positive: 1043, positive conditional: 0, positive unconditional: 1043, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1079, positive: 1043, positive conditional: 0, positive unconditional: 1043, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1079, positive: 1037, positive conditional: 0, positive unconditional: 1037, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 824, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 802, negative conditional: 0, negative unconditional: 802, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1472, positive: 346, positive conditional: 0, positive unconditional: 346, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 1079, unknown conditional: 0, unknown unconditional: 1079] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L713]               0  int __unbuffered_p2_EBX = 0;
[L714]               0  _Bool main$tmp_guard0;
[L715]               0  _Bool main$tmp_guard1;
[L717]               0  int x = 0;
[L719]               0  int y = 0;
[L720]               0  _Bool y$flush_delayed;
[L721]               0  int y$mem_tmp;
[L722]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L723]               0  _Bool y$r_buff0_thd1;
[L724]               0  _Bool y$r_buff0_thd2;
[L725]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L726]               0  _Bool y$r_buff1_thd0;
[L727]               0  _Bool y$r_buff1_thd1;
[L728]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L729]               0  _Bool y$r_buff1_thd3;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L737]               0  int z = 0;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L831]               0  pthread_t t763;
[L832]  FCALL, FORK  0  pthread_create(&t763, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L833]               0  pthread_t t764;
[L834]  FCALL, FORK  0  pthread_create(&t764, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L835]               0  pthread_t t765;
[L836]  FCALL, FORK  0  pthread_create(&t765, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L778]               3  y$w_buff1 = y$w_buff0
[L779]               3  y$w_buff0 = 2
[L780]               3  y$w_buff1_used = y$w_buff0_used
[L781]               3  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   3  !(!expression)
[L783]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L784]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L785]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L786]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L787]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1
[L794]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L806]               3  __unbuffered_p2_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L743]               1  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L746]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L758]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L761]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L764]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L764]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L765]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L765]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L766]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L766]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L767]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L767]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L768]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L768]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L751]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L753]               1  return 0;
[L771]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L773]               2  return 0;
[L809]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L809]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L810]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L810]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L811]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L811]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L812]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L812]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L813]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L813]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L816]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L818]               3  return 0;
[L838]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L842]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L842]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L842]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L842]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L843]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L843]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L844]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L844]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L845]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L845]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L846]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L846]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L849]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L850]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L851]               0  y$flush_delayed = weak$$choice2
[L852]               0  y$mem_tmp = y
[L853]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L853]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L854]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L854]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L854]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L854]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L855]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L855]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L855]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L855]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L856]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L856]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L856]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L856]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L857]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L857]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L857]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L857]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L858]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L858]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L858]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L858]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L859]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L859]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L859]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L860]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0)
[L861]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L861]               0  y = y$flush_delayed ? y$mem_tmp : y
[L862]               0  y$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10652.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 815.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8238.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 37 SDslu, 39 SDs, 0 SdLazy, 169 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 208.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 180.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.3ms SsaConstructionTime, 569.9ms SatisfiabilityAnalysisTime, 685.0ms InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 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...