/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239
[2021-03-25 14:48:08,121 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-03-25 14:48:08,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-25 14:48:08,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-25 14:48:08,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-25 14:48:08,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-25 14:48:08,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-25 14:48:08,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-25 14:48:08,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-25 14:48:08,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-25 14:48:08,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-03-25 14:48:08,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-25 14:48:08,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-25 14:48:08,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-25 14:48:08,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-25 14:48:08,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-25 14:48:08,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-25 14:48:08,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-25 14:48:08,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-25 14:48:08,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-25 14:48:08,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-25 14:48:08,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-25 14:48:08,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-03-25 14:48:08,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-25 14:48:08,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-25 14:48:08,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-25 14:48:08,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-25 14:48:08,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-25 14:48:08,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-25 14:48:08,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-25 14:48:08,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-25 14:48:08,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-25 14:48:08,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-25 14:48:08,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-25 14:48:08,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-25 14:48:08,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-25 14:48:08,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-25 14:48:08,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-25 14:48:08,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-25 14:48:08,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-25 14:48:08,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-03-25 14:48:08,175 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-RepeatedSemanticLbe.epf
[2021-03-25 14:48:08,200 INFO L113 SettingsManager]: Loading preferences was successful
[2021-03-25 14:48:08,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-25 14:48:08,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-25 14:48:08,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-03-25 14:48:08,202 INFO L138 SettingsManager]: * Use SBE=true
[2021-03-25 14:48:08,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-25 14:48:08,203 INFO L138 SettingsManager]: * sizeof long=4
[2021-03-25 14:48:08,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-03-25 14:48:08,203 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-03-25 14:48:08,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-03-25 14:48:08,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-03-25 14:48:08,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-25 14:48:08,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-03-25 14:48:08,204 INFO L138 SettingsManager]: * sizeof long double=12
[2021-03-25 14:48:08,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-03-25 14:48:08,204 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-03-25 14:48:08,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-03-25 14:48:08,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-25 14:48:08,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-03-25 14:48:08,205 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-03-25 14:48:08,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-03-25 14:48:08,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-25 14:48:08,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-25 14:48:08,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-03-25 14:48:08,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-25 14:48:08,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-03-25 14:48:08,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-25 14:48:08,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-25 14:48:08,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2021-03-25 14:48:08,207 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true
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-25 14:48:08,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-25 14:48:08,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-25 14:48:08,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-25 14:48:08,525 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-03-25 14:48:08,526 INFO L275 PluginConnector]: CDTParser initialized
[2021-03-25 14:48:08,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i
[2021-03-25 14:48:08,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b9d4a8a/dbe02e87ce4d404089fd351473ef82e9/FLAGb68b672eb
[2021-03-25 14:48:09,166 INFO L306 CDTParser]: Found 1 translation units.
[2021-03-25 14:48:09,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i
[2021-03-25 14:48:09,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b9d4a8a/dbe02e87ce4d404089fd351473ef82e9/FLAGb68b672eb
[2021-03-25 14:48:09,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b9d4a8a/dbe02e87ce4d404089fd351473ef82e9
[2021-03-25 14:48:09,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-25 14:48:09,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-25 14:48:09,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-25 14:48:09,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-25 14:48:09,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-25 14:48:09,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:48:09" (1/1) ...
[2021-03-25 14:48:09,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba6bbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:09, skipping insertion in model container
[2021-03-25 14:48:09,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:48:09" (1/1) ...
[2021-03-25 14:48:09,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-03-25 14:48:09,632 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-03-25 14:48:09,782 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/safe002_rmo.oepc.i[993,1006]
[2021-03-25 14:48:09,958 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-25 14:48:09,972 INFO L203 MainTranslator]: Completed pre-run
[2021-03-25 14:48:09,984 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/safe002_rmo.oepc.i[993,1006]
[2021-03-25 14:48:10,060 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-25 14:48:10,136 INFO L208 MainTranslator]: Completed translation
[2021-03-25 14:48:10,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10 WrapperNode
[2021-03-25 14:48:10,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-25 14:48:10,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-25 14:48:10,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-25 14:48:10,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-25 14:48:10,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-25 14:48:10,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-25 14:48:10,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-25 14:48:10,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-03-25 14:48:10,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (1/1) ...
[2021-03-25 14:48:10,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-25 14:48:10,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-25 14:48:10,282 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-03-25 14:48:10,282 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-03-25 14:48:10,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (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-25 14:48:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2021-03-25 14:48:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-03-25 14:48:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-25 14:48:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-25 14:48:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-25 14:48:10,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-03-25 14:48:10,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-03-25 14:48:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-03-25 14:48:10,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-03-25 14:48:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-03-25 14:48:10,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-03-25 14:48:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-25 14:48:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-25 14:48:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-25 14:48:10,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-25 14:48:10,374 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-25 14:48:13,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-25 14:48:13,335 INFO L299 CfgBuilder]: Removed 8 assume(true) statements.
[2021-03-25 14:48:13,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:48:13 BoogieIcfgContainer
[2021-03-25 14:48:13,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-25 14:48:13,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-25 14:48:13,338 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-03-25 14:48:13,340 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-03-25 14:48:13,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:48:09" (1/3) ...
[2021-03-25 14:48:13,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626fd99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:48:13, skipping insertion in model container
[2021-03-25 14:48:13,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:48:10" (2/3) ...
[2021-03-25 14:48:13,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626fd99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:48:13, skipping insertion in model container
[2021-03-25 14:48:13,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:48:13" (3/3) ...
[2021-03-25 14:48:13,342 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i
[2021-03-25 14:48:13,347 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-25 14:48:13,351 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-03-25 14:48:13,352 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-25 14:48:13,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,437 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,437 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:48:13,450 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-25 14:48:13,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-03-25 14:48:13,497 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-03-25 14:48:13,498 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-03-25 14:48:13,498 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-25 14:48:13,498 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-25 14:48:13,498 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-25 14:48:13,498 INFO L381 AbstractCegarLoop]: Difference is false
[2021-03-25 14:48:13,498 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-25 14:48:13,501 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-25 14:48:13,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow
[2021-03-25 14:48:13,556 INFO L129 PetriNetUnfolder]: 2/111 cut-off events.
[2021-03-25 14:48:13,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:13,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place.
[2021-03-25 14:48:13,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow
[2021-03-25 14:48:13,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 99 transitions, 207 flow
[2021-03-25 14:48:13,569 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:13,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 99 transitions, 207 flow
[2021-03-25 14:48:13,581 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 99 transitions, 207 flow
[2021-03-25 14:48:13,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 99 transitions, 207 flow
[2021-03-25 14:48:13,603 INFO L129 PetriNetUnfolder]: 1/99 cut-off events.
[2021-03-25 14:48:13,603 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:13,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 1/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place.
[2021-03-25 14:48:13,606 INFO L142 LiptonReduction]: Number of co-enabled transitions 1018
[2021-03-25 14:48:14,571 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191
[2021-03-25 14:48:14,869 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 189
[2021-03-25 14:48:16,264 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 315 DAG size of output: 271
[2021-03-25 14:48:16,910 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-25 14:48:19,899 WARN L205 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198
[2021-03-25 14:48:20,543 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 195
[2021-03-25 14:48:21,922 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 322 DAG size of output: 278
[2021-03-25 14:48:22,513 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 275
[2021-03-25 14:48:22,786 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70
[2021-03-25 14:48:23,189 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93
[2021-03-25 14:48:23,323 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2021-03-25 14:48:31,506 WARN L205 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 237
[2021-03-25 14:48:31,914 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 235
[2021-03-25 14:48:33,727 WARN L205 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 370 DAG size of output: 326
[2021-03-25 14:48:34,574 WARN L205 SmtUtils]: Spent 845.00 ms on a formula simplification that was a NOOP. DAG size: 323
[2021-03-25 14:48:39,065 INFO L154 LiptonReduction]: Checked pairs total: 1971
[2021-03-25 14:48:39,065 INFO L156 LiptonReduction]: Total number of compositions: 63
[2021-03-25 14:48:39,066 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25498
[2021-03-25 14:48:39,083 INFO L129 PetriNetUnfolder]: 1/37 cut-off events.
[2021-03-25 14:48:39,083 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:39,084 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:39,085 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]
[2021-03-25 14:48:39,085 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:39,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:39,089 INFO L82 PathProgramCache]: Analyzing trace with hash -231262278, now seen corresponding path program 1 times
[2021-03-25 14:48:39,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:39,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615330063]
[2021-03-25 14:48:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:39,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:39,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:39,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:39,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:39,294 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-25 14:48:39,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615330063]
[2021-03-25 14:48:39,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:39,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-25 14:48:39,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210427005]
[2021-03-25 14:48:39,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states
[2021-03-25 14:48:39,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2021-03-25 14:48:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-03-25 14:48:39,322 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 177
[2021-03-25 14:48:39,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 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-25 14:48:39,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:39,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 177
[2021-03-25 14:48:39,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:39,335 INFO L129 PetriNetUnfolder]: 0/36 cut-off events.
[2021-03-25 14:48:39,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:39,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.
[2021-03-25 14:48:39,336 INFO L132 encePairwiseOnDemand]: 176/177 looper letters, 0 selfloop transitions, 0 changer transitions 0/36 dead transitions.
[2021-03-25 14:48:39,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 81 flow
[2021-03-25 14:48:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2021-03-25 14:48:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2021-03-25 14:48:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions.
[2021-03-25 14:48:39,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9745762711864406
[2021-03-25 14:48:39,347 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 345 transitions.
[2021-03-25 14:48:39,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 345 transitions.
[2021-03-25 14:48:39,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:39,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 345 transitions.
[2021-03-25 14:48:39,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 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-25 14:48:39,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-25 14:48:39,358 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-25 14:48:39,360 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 2 states and 345 transitions.
[2021-03-25 14:48:39,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 81 flow
[2021-03-25 14:48:39,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-25 14:48:39,363 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 78 flow
[2021-03-25 14:48:39,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=36}
[2021-03-25 14:48:39,366 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places.
[2021-03-25 14:48:39,366 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:39,366 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 78 flow
[2021-03-25 14:48:39,366 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 78 flow
[2021-03-25 14:48:39,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 78 flow
[2021-03-25 14:48:39,373 INFO L129 PetriNetUnfolder]: 0/36 cut-off events.
[2021-03-25 14:48:39,373 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:39,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.
[2021-03-25 14:48:39,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 230
[2021-03-25 14:48:39,516 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52
[2021-03-25 14:48:39,690 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52
[2021-03-25 14:48:40,148 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 238
[2021-03-25 14:48:40,564 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 238
[2021-03-25 14:48:42,337 WARN L205 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 326 DAG size of output: 325
[2021-03-25 14:48:43,182 WARN L205 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 325
[2021-03-25 14:48:45,397 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2021-03-25 14:48:45,551 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2021-03-25 14:48:53,171 INFO L154 LiptonReduction]: Checked pairs total: 965
[2021-03-25 14:48:53,172 INFO L156 LiptonReduction]: Total number of compositions: 12
[2021-03-25 14:48:53,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13806
[2021-03-25 14:48:53,173 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 54 flow
[2021-03-25 14:48:53,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 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-25 14:48:53,173 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:53,173 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]
[2021-03-25 14:48:53,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-25 14:48:53,174 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -231401623, now seen corresponding path program 1 times
[2021-03-25 14:48:53,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:53,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570986193]
[2021-03-25 14:48:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:53,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:53,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:53,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:53,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:53,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:53,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-25 14:48:53,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-25 14:48:53,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570986193]
[2021-03-25 14:48:53,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:53,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:48:53,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153822249]
[2021-03-25 14:48:53,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:48:53,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:53,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:48:53,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:48:53,438 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189
[2021-03-25 14:48:53,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 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-25 14:48:53,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:53,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189
[2021-03-25 14:48:53,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:53,462 INFO L129 PetriNetUnfolder]: 0/24 cut-off events.
[2021-03-25 14:48:53,462 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:48:53,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place.
[2021-03-25 14:48:53,462 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions.
[2021-03-25 14:48:53,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 60 flow
[2021-03-25 14:48:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-03-25 14:48:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-25 14:48:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions.
[2021-03-25 14:48:53,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9118165784832452
[2021-03-25 14:48:53,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions.
[2021-03-25 14:48:53,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions.
[2021-03-25 14:48:53,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:53,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions.
[2021-03-25 14:48:53,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-25 14:48:53,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-25 14:48:53,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-25 14:48:53,472 INFO L185 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 517 transitions.
[2021-03-25 14:48:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 60 flow
[2021-03-25 14:48:53,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-03-25 14:48:53,474 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 62 flow
[2021-03-25 14:48:53,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=24}
[2021-03-25 14:48:53,474 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places.
[2021-03-25 14:48:53,474 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:53,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 62 flow
[2021-03-25 14:48:53,475 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 62 flow
[2021-03-25 14:48:53,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow
[2021-03-25 14:48:53,480 INFO L129 PetriNetUnfolder]: 0/24 cut-off events.
[2021-03-25 14:48:53,480 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2021-03-25 14:48:53,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place.
[2021-03-25 14:48:53,481 INFO L142 LiptonReduction]: Number of co-enabled transitions 184
[2021-03-25 14:48:54,157 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2021-03-25 14:48:54,275 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104
[2021-03-25 14:48:54,397 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2021-03-25 14:48:54,530 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104
[2021-03-25 14:48:54,533 INFO L154 LiptonReduction]: Checked pairs total: 645
[2021-03-25 14:48:54,534 INFO L156 LiptonReduction]: Total number of compositions: 3
[2021-03-25 14:48:54,534 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1060
[2021-03-25 14:48:54,535 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow
[2021-03-25 14:48:54,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 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-25 14:48:54,535 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:54,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:54,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-25 14:48:54,536 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash -300518517, now seen corresponding path program 1 times
[2021-03-25 14:48:54,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:54,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562480830]
[2021-03-25 14:48:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:54,667 INFO L142 QuantifierPusher]: treesize reduction 10, result has 28.6 percent of original size
[2021-03-25 14:48:54,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:48:54,673 INFO L142 QuantifierPusher]: treesize reduction 10, result has 44.4 percent of original size
[2021-03-25 14:48:54,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8
[2021-03-25 14:48:54,680 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-25 14:48:54,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562480830]
[2021-03-25 14:48:54,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:54,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-25 14:48:54,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276319027]
[2021-03-25 14:48:54,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:48:54,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:48:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:48:54,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 192
[2021-03-25 14:48:54,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-25 14:48:54,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:54,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 192
[2021-03-25 14:48:54,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:54,719 INFO L129 PetriNetUnfolder]: 0/21 cut-off events.
[2021-03-25 14:48:54,719 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2021-03-25 14:48:54,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 21 events. 0/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place.
[2021-03-25 14:48:54,719 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 1 selfloop transitions, 3 changer transitions 0/21 dead transitions.
[2021-03-25 14:48:54,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 64 flow
[2021-03-25 14:48:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-03-25 14:48:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2021-03-25 14:48:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions.
[2021-03-25 14:48:54,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90234375
[2021-03-25 14:48:54,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions.
[2021-03-25 14:48:54,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions.
[2021-03-25 14:48:54,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:54,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions.
[2021-03-25 14:48:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 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-25 14:48:54,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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-25 14:48:54,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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-25 14:48:54,728 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 693 transitions.
[2021-03-25 14:48:54,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 64 flow
[2021-03-25 14:48:54,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:54,729 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 62 flow
[2021-03-25 14:48:54,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=21}
[2021-03-25 14:48:54,730 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places.
[2021-03-25 14:48:54,730 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:54,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 62 flow
[2021-03-25 14:48:54,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 62 flow
[2021-03-25 14:48:54,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 62 flow
[2021-03-25 14:48:54,737 INFO L129 PetriNetUnfolder]: 0/21 cut-off events.
[2021-03-25 14:48:54,737 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2021-03-25 14:48:54,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place.
[2021-03-25 14:48:54,737 INFO L142 LiptonReduction]: Number of co-enabled transitions 182
[2021-03-25 14:48:55,350 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159
[2021-03-25 14:48:55,677 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 155
[2021-03-25 14:48:56,321 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159
[2021-03-25 14:48:56,590 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 155
[2021-03-25 14:48:56,593 INFO L154 LiptonReduction]: Checked pairs total: 400
[2021-03-25 14:48:56,593 INFO L156 LiptonReduction]: Total number of compositions: 1
[2021-03-25 14:48:56,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1864
[2021-03-25 14:48:56,594 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow
[2021-03-25 14:48:56,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-25 14:48:56,595 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:56,595 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:56,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-25 14:48:56,596 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2013845203, now seen corresponding path program 1 times
[2021-03-25 14:48:56,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:56,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617223332]
[2021-03-25 14:48:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:56,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:56,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:56,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:56,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-25 14:48:56,775 INFO L142 QuantifierPusher]: treesize reduction 21, result has 82.4 percent of original size
[2021-03-25 14:48:56,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98
[2021-03-25 14:48:56,790 INFO L142 QuantifierPusher]: treesize reduction 21, result has 82.4 percent of original size
[2021-03-25 14:48:56,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98
[2021-03-25 14:48:56,802 INFO L142 QuantifierPusher]: treesize reduction 21, result has 81.7 percent of original size
[2021-03-25 14:48:56,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94
[2021-03-25 14:48:56,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:56,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:48:56,839 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-25 14:48:56,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617223332]
[2021-03-25 14:48:56,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:56,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-25 14:48:56,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907851891]
[2021-03-25 14:48:56,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-25 14:48:56,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-25 14:48:56,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-25 14:48:56,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 193
[2021-03-25 14:48:56,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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-25 14:48:56,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:56,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 193
[2021-03-25 14:48:56,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:57,019 INFO L129 PetriNetUnfolder]: 124/262 cut-off events.
[2021-03-25 14:48:57,019 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES.
[2021-03-25 14:48:57,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 262 events. 124/262 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1183 event pairs, 29 based on Foata normal form. 9/267 useless extension candidates. Maximal degree in co-relation 598. Up to 109 conditions per place.
[2021-03-25 14:48:57,021 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 15 selfloop transitions, 4 changer transitions 8/36 dead transitions.
[2021-03-25 14:48:57,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 154 flow
[2021-03-25 14:48:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-25 14:48:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-25 14:48:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions.
[2021-03-25 14:48:57,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6818652849740933
[2021-03-25 14:48:57,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions.
[2021-03-25 14:48:57,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions.
[2021-03-25 14:48:57,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:57,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions.
[2021-03-25 14:48:57,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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-25 14:48:57,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:57,031 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:57,032 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 658 transitions.
[2021-03-25 14:48:57,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 154 flow
[2021-03-25 14:48:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:57,033 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 86 flow
[2021-03-25 14:48:57,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=22}
[2021-03-25 14:48:57,033 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places.
[2021-03-25 14:48:57,033 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:57,034 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 86 flow
[2021-03-25 14:48:57,034 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 86 flow
[2021-03-25 14:48:57,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 86 flow
[2021-03-25 14:48:57,040 INFO L129 PetriNetUnfolder]: 5/37 cut-off events.
[2021-03-25 14:48:57,041 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2021-03-25 14:48:57,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 37 events. 5/37 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 2 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 71. Up to 12 conditions per place.
[2021-03-25 14:48:57,041 INFO L142 LiptonReduction]: Number of co-enabled transitions 184
[2021-03-25 14:48:57,080 INFO L154 LiptonReduction]: Checked pairs total: 109
[2021-03-25 14:48:57,080 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:57,080 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47
[2021-03-25 14:48:57,081 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 86 flow
[2021-03-25 14:48:57,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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-25 14:48:57,082 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:57,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:57,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-25 14:48:57,082 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1709316730, now seen corresponding path program 1 times
[2021-03-25 14:48:57,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:57,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321645600]
[2021-03-25 14:48:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:57,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-25 14:48:57,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-25 14:48:57,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-25 14:48:57,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-25 14:48:57,242 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-25 14:48:57,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321645600]
[2021-03-25 14:48:57,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:57,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-25 14:48:57,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057933571]
[2021-03-25 14:48:57,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:48:57,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:48:57,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:48:57,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 193
[2021-03-25 14:48:57,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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-25 14:48:57,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:57,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 193
[2021-03-25 14:48:57,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:57,376 INFO L129 PetriNetUnfolder]: 79/180 cut-off events.
[2021-03-25 14:48:57,377 INFO L130 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES.
[2021-03-25 14:48:57,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 180 events. 79/180 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 725 event pairs, 34 based on Foata normal form. 3/181 useless extension candidates. Maximal degree in co-relation 513. Up to 122 conditions per place.
[2021-03-25 14:48:57,380 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/27 dead transitions.
[2021-03-25 14:48:57,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 143 flow
[2021-03-25 14:48:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-03-25 14:48:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2021-03-25 14:48:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions.
[2021-03-25 14:48:57,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.716321243523316
[2021-03-25 14:48:57,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions.
[2021-03-25 14:48:57,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions.
[2021-03-25 14:48:57,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:57,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions.
[2021-03-25 14:48:57,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 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-25 14:48:57,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:57,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:57,388 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 86 flow. Second operand 4 states and 553 transitions.
[2021-03-25 14:48:57,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 143 flow
[2021-03-25 14:48:57,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 136 flow, removed 1 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:57,391 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 117 flow
[2021-03-25 14:48:57,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=37, PETRI_TRANSITIONS=25}
[2021-03-25 14:48:57,396 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places.
[2021-03-25 14:48:57,396 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:57,396 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 117 flow
[2021-03-25 14:48:57,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 117 flow
[2021-03-25 14:48:57,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 117 flow
[2021-03-25 14:48:57,407 INFO L129 PetriNetUnfolder]: 19/66 cut-off events.
[2021-03-25 14:48:57,407 INFO L130 PetriNetUnfolder]: For 61/73 co-relation queries the response was YES.
[2021-03-25 14:48:57,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 66 events. 19/66 cut-off events. For 61/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 205 event pairs, 5 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 169. Up to 33 conditions per place.
[2021-03-25 14:48:57,409 INFO L142 LiptonReduction]: Number of co-enabled transitions 198
[2021-03-25 14:48:57,413 INFO L154 LiptonReduction]: Checked pairs total: 135
[2021-03-25 14:48:57,413 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:57,413 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17
[2021-03-25 14:48:57,414 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 117 flow
[2021-03-25 14:48:57,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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-25 14:48:57,415 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:57,415 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:57,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-25 14:48:57,415 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash -845888069, now seen corresponding path program 1 times
[2021-03-25 14:48:57,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:57,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459016976]
[2021-03-25 14:48:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:57,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-03-25 14:48:57,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28
[2021-03-25 14:48:57,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24
[2021-03-25 14:48:57,587 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size
[2021-03-25 14:48:57,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-25 14:48:57,603 INFO L142 QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size
[2021-03-25 14:48:57,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-25 14:48:57,615 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size
[2021-03-25 14:48:57,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:48:57,624 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-25 14:48:57,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459016976]
[2021-03-25 14:48:57,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:57,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-25 14:48:57,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791448649]
[2021-03-25 14:48:57,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-25 14:48:57,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:57,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-25 14:48:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2021-03-25 14:48:57,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 193
[2021-03-25 14:48:57,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-25 14:48:57,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:57,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 193
[2021-03-25 14:48:57,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:57,854 INFO L129 PetriNetUnfolder]: 80/194 cut-off events.
[2021-03-25 14:48:57,854 INFO L130 PetriNetUnfolder]: For 188/192 co-relation queries the response was YES.
[2021-03-25 14:48:57,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 194 events. 80/194 cut-off events. For 188/192 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 843 event pairs, 8 based on Foata normal form. 14/208 useless extension candidates. Maximal degree in co-relation 599. Up to 79 conditions per place.
[2021-03-25 14:48:57,856 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 16 selfloop transitions, 4 changer transitions 9/38 dead transitions.
[2021-03-25 14:48:57,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 240 flow
[2021-03-25 14:48:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-25 14:48:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-25 14:48:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions.
[2021-03-25 14:48:57,859 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6290155440414508
[2021-03-25 14:48:57,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions.
[2021-03-25 14:48:57,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions.
[2021-03-25 14:48:57,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:57,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions.
[2021-03-25 14:48:57,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-25 14:48:57,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:57,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:57,863 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 117 flow. Second operand 5 states and 607 transitions.
[2021-03-25 14:48:57,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 240 flow
[2021-03-25 14:48:57,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:57,867 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 125 flow
[2021-03-25 14:48:57,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=24}
[2021-03-25 14:48:57,868 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places.
[2021-03-25 14:48:57,868 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:57,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 125 flow
[2021-03-25 14:48:57,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 125 flow
[2021-03-25 14:48:57,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 125 flow
[2021-03-25 14:48:57,877 INFO L129 PetriNetUnfolder]: 11/46 cut-off events.
[2021-03-25 14:48:57,877 INFO L130 PetriNetUnfolder]: For 71/79 co-relation queries the response was YES.
[2021-03-25 14:48:57,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 46 events. 11/46 cut-off events. For 71/79 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 112 event pairs, 5 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 122. Up to 18 conditions per place.
[2021-03-25 14:48:57,878 INFO L142 LiptonReduction]: Number of co-enabled transitions 180
[2021-03-25 14:48:57,879 INFO L154 LiptonReduction]: Checked pairs total: 110
[2021-03-25 14:48:57,879 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:57,880 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12
[2021-03-25 14:48:57,885 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 125 flow
[2021-03-25 14:48:57,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-25 14:48:57,885 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:57,886 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:57,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-25 14:48:57,886 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1640509663, now seen corresponding path program 1 times
[2021-03-25 14:48:57,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:57,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620651187]
[2021-03-25 14:48:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:57,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-25 14:48:57,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-25 14:48:57,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20
[2021-03-25 14:48:57,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:57,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-25 14:48:58,011 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-25 14:48:58,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620651187]
[2021-03-25 14:48:58,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:58,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:48:58,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569359543]
[2021-03-25 14:48:58,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-25 14:48:58,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:58,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-25 14:48:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-25 14:48:58,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193
[2021-03-25 14:48:58,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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-25 14:48:58,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:58,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193
[2021-03-25 14:48:58,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:58,145 INFO L129 PetriNetUnfolder]: 67/173 cut-off events.
[2021-03-25 14:48:58,145 INFO L130 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES.
[2021-03-25 14:48:58,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 67/173 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 773 event pairs, 29 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 569. Up to 107 conditions per place.
[2021-03-25 14:48:58,148 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 15 selfloop transitions, 6 changer transitions 0/30 dead transitions.
[2021-03-25 14:48:58,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 200 flow
[2021-03-25 14:48:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-03-25 14:48:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2021-03-25 14:48:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions.
[2021-03-25 14:48:58,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7007772020725389
[2021-03-25 14:48:58,152 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions.
[2021-03-25 14:48:58,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions.
[2021-03-25 14:48:58,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:58,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions.
[2021-03-25 14:48:58,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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-25 14:48:58,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:58,155 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:58,155 INFO L185 Difference]: Start difference. First operand has 41 places, 24 transitions, 125 flow. Second operand 4 states and 541 transitions.
[2021-03-25 14:48:58,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 200 flow
[2021-03-25 14:48:58,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 170 flow, removed 8 selfloop flow, removed 6 redundant places.
[2021-03-25 14:48:58,160 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 146 flow
[2021-03-25 14:48:58,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=28}
[2021-03-25 14:48:58,160 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places.
[2021-03-25 14:48:58,160 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:58,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 146 flow
[2021-03-25 14:48:58,160 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 146 flow
[2021-03-25 14:48:58,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 146 flow
[2021-03-25 14:48:58,175 INFO L129 PetriNetUnfolder]: 25/85 cut-off events.
[2021-03-25 14:48:58,175 INFO L130 PetriNetUnfolder]: For 92/149 co-relation queries the response was YES.
[2021-03-25 14:48:58,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 85 events. 25/85 cut-off events. For 92/149 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 310 event pairs, 9 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 233. Up to 32 conditions per place.
[2021-03-25 14:48:58,176 INFO L142 LiptonReduction]: Number of co-enabled transitions 194
[2021-03-25 14:48:58,178 INFO L154 LiptonReduction]: Checked pairs total: 111
[2021-03-25 14:48:58,178 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:58,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18
[2021-03-25 14:48:58,179 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 146 flow
[2021-03-25 14:48:58,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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-25 14:48:58,179 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:58,179 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:58,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-25 14:48:58,180 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 773103149, now seen corresponding path program 2 times
[2021-03-25 14:48:58,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:58,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320762449]
[2021-03-25 14:48:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:58,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-03-25 14:48:58,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38
[2021-03-25 14:48:58,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44
[2021-03-25 14:48:58,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41
[2021-03-25 14:48:58,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42
[2021-03-25 14:48:58,504 INFO L142 QuantifierPusher]: treesize reduction 26, result has 68.7 percent of original size
[2021-03-25 14:48:58,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57
[2021-03-25 14:48:58,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:58,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-03-25 14:48:58,589 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-25 14:48:58,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320762449]
[2021-03-25 14:48:58,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:58,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-25 14:48:58,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117918420]
[2021-03-25 14:48:58,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-03-25 14:48:58,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-03-25 14:48:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2021-03-25 14:48:58,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 193
[2021-03-25 14:48:58,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 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-25 14:48:58,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:58,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 193
[2021-03-25 14:48:58,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:59,024 INFO L129 PetriNetUnfolder]: 99/248 cut-off events.
[2021-03-25 14:48:59,024 INFO L130 PetriNetUnfolder]: For 363/367 co-relation queries the response was YES.
[2021-03-25 14:48:59,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 248 events. 99/248 cut-off events. For 363/367 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1218 event pairs, 17 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 850. Up to 92 conditions per place.
[2021-03-25 14:48:59,026 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 20 selfloop transitions, 15 changer transitions 0/44 dead transitions.
[2021-03-25 14:48:59,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 313 flow
[2021-03-25 14:48:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-25 14:48:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-25 14:48:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions.
[2021-03-25 14:48:59,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6617320503330866
[2021-03-25 14:48:59,030 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions.
[2021-03-25 14:48:59,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions.
[2021-03-25 14:48:59,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:59,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions.
[2021-03-25 14:48:59,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 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-25 14:48:59,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:48:59,035 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:48:59,036 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 146 flow. Second operand 7 states and 894 transitions.
[2021-03-25 14:48:59,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 313 flow
[2021-03-25 14:48:59,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:59,038 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 246 flow
[2021-03-25 14:48:59,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=46, PETRI_TRANSITIONS=35}
[2021-03-25 14:48:59,038 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places.
[2021-03-25 14:48:59,038 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:59,039 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 246 flow
[2021-03-25 14:48:59,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 246 flow
[2021-03-25 14:48:59,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 246 flow
[2021-03-25 14:48:59,055 INFO L129 PetriNetUnfolder]: 42/136 cut-off events.
[2021-03-25 14:48:59,055 INFO L130 PetriNetUnfolder]: For 415/446 co-relation queries the response was YES.
[2021-03-25 14:48:59,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 136 events. 42/136 cut-off events. For 415/446 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 583 event pairs, 7 based on Foata normal form. 12/134 useless extension candidates. Maximal degree in co-relation 458. Up to 55 conditions per place.
[2021-03-25 14:48:59,057 INFO L142 LiptonReduction]: Number of co-enabled transitions 246
[2021-03-25 14:48:59,062 INFO L154 LiptonReduction]: Checked pairs total: 189
[2021-03-25 14:48:59,062 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:59,062 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24
[2021-03-25 14:48:59,063 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 246 flow
[2021-03-25 14:48:59,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 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-25 14:48:59,063 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:59,063 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:59,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-25 14:48:59,063 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1910747401, now seen corresponding path program 1 times
[2021-03-25 14:48:59,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:59,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797444445]
[2021-03-25 14:48:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:59,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:59,182 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size
[2021-03-25 14:48:59,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-25 14:48:59,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:59,191 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-25 14:48:59,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797444445]
[2021-03-25 14:48:59,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:59,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:48:59,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637936771]
[2021-03-25 14:48:59,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:48:59,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:59,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:48:59,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:48:59,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 193
[2021-03-25 14:48:59,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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-25 14:48:59,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:59,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 193
[2021-03-25 14:48:59,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:59,264 INFO L129 PetriNetUnfolder]: 144/343 cut-off events.
[2021-03-25 14:48:59,264 INFO L130 PetriNetUnfolder]: For 957/1090 co-relation queries the response was YES.
[2021-03-25 14:48:59,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 343 events. 144/343 cut-off events. For 957/1090 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1945 event pairs, 45 based on Foata normal form. 83/406 useless extension candidates. Maximal degree in co-relation 1050. Up to 173 conditions per place.
[2021-03-25 14:48:59,267 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 9 selfloop transitions, 8 changer transitions 0/45 dead transitions.
[2021-03-25 14:48:59,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 300 flow
[2021-03-25 14:48:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-25 14:48:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-25 14:48:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions.
[2021-03-25 14:48:59,270 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883937823834197
[2021-03-25 14:48:59,270 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions.
[2021-03-25 14:48:59,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions.
[2021-03-25 14:48:59,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:59,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions.
[2021-03-25 14:48:59,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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-25 14:48:59,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:59,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-25 14:48:59,274 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 246 flow. Second operand 5 states and 853 transitions.
[2021-03-25 14:48:59,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 300 flow
[2021-03-25 14:48:59,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-25 14:48:59,279 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 309 flow
[2021-03-25 14:48:59,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=52, PETRI_TRANSITIONS=42}
[2021-03-25 14:48:59,279 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places.
[2021-03-25 14:48:59,279 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:59,279 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 309 flow
[2021-03-25 14:48:59,280 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 309 flow
[2021-03-25 14:48:59,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 309 flow
[2021-03-25 14:48:59,316 INFO L129 PetriNetUnfolder]: 142/340 cut-off events.
[2021-03-25 14:48:59,316 INFO L130 PetriNetUnfolder]: For 1114/1245 co-relation queries the response was YES.
[2021-03-25 14:48:59,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 340 events. 142/340 cut-off events. For 1114/1245 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1963 event pairs, 41 based on Foata normal form. 36/349 useless extension candidates. Maximal degree in co-relation 1233. Up to 168 conditions per place.
[2021-03-25 14:48:59,320 INFO L142 LiptonReduction]: Number of co-enabled transitions 380
[2021-03-25 14:48:59,364 INFO L154 LiptonReduction]: Checked pairs total: 245
[2021-03-25 14:48:59,364 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:59,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85
[2021-03-25 14:48:59,365 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 309 flow
[2021-03-25 14:48:59,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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-25 14:48:59,365 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:59,365 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:59,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-25 14:48:59,365 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 714370507, now seen corresponding path program 1 times
[2021-03-25 14:48:59,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:59,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321364599]
[2021-03-25 14:48:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:59,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:59,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:59,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:59,430 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-25 14:48:59,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321364599]
[2021-03-25 14:48:59,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:59,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:48:59,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615499897]
[2021-03-25 14:48:59,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:48:59,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:59,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:48:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:48:59,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 193
[2021-03-25 14:48:59,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-25 14:48:59,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:59,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 193
[2021-03-25 14:48:59,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:59,513 INFO L129 PetriNetUnfolder]: 225/529 cut-off events.
[2021-03-25 14:48:59,514 INFO L130 PetriNetUnfolder]: For 2017/2287 co-relation queries the response was YES.
[2021-03-25 14:48:59,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 529 events. 225/529 cut-off events. For 2017/2287 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 3429 event pairs, 78 based on Foata normal form. 63/541 useless extension candidates. Maximal degree in co-relation 1929. Up to 278 conditions per place.
[2021-03-25 14:48:59,519 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 3 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2021-03-25 14:48:59,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 321 flow
[2021-03-25 14:48:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-03-25 14:48:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2021-03-25 14:48:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions.
[2021-03-25 14:48:59,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883419689119171
[2021-03-25 14:48:59,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 682 transitions.
[2021-03-25 14:48:59,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions.
[2021-03-25 14:48:59,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:59,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions.
[2021-03-25 14:48:59,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 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-25 14:48:59,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:59,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-25 14:48:59,526 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 309 flow. Second operand 4 states and 682 transitions.
[2021-03-25 14:48:59,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 321 flow
[2021-03-25 14:48:59,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-25 14:48:59,531 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 318 flow
[2021-03-25 14:48:59,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=56, PETRI_TRANSITIONS=43}
[2021-03-25 14:48:59,532 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places.
[2021-03-25 14:48:59,532 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:59,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 318 flow
[2021-03-25 14:48:59,532 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 318 flow
[2021-03-25 14:48:59,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 318 flow
[2021-03-25 14:48:59,615 INFO L129 PetriNetUnfolder]: 218/517 cut-off events.
[2021-03-25 14:48:59,615 INFO L130 PetriNetUnfolder]: For 1636/1849 co-relation queries the response was YES.
[2021-03-25 14:48:59,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 517 events. 218/517 cut-off events. For 1636/1849 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3314 event pairs, 75 based on Foata normal form. 44/509 useless extension candidates. Maximal degree in co-relation 1844. Up to 279 conditions per place.
[2021-03-25 14:48:59,622 INFO L142 LiptonReduction]: Number of co-enabled transitions 382
[2021-03-25 14:48:59,653 INFO L154 LiptonReduction]: Checked pairs total: 84
[2021-03-25 14:48:59,654 INFO L156 LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:48:59,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122
[2021-03-25 14:48:59,654 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 318 flow
[2021-03-25 14:48:59,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-25 14:48:59,655 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:59,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:59,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-25 14:48:59,655 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash 482264549, now seen corresponding path program 1 times
[2021-03-25 14:48:59,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:59,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539762046]
[2021-03-25 14:48:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:48:59,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:59,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:48:59,750 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size
[2021-03-25 14:48:59,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-25 14:48:59,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:48:59,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:48:59,760 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-25 14:48:59,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539762046]
[2021-03-25 14:48:59,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:48:59,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-25 14:48:59,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447631766]
[2021-03-25 14:48:59,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-25 14:48:59,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:48:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-25 14:48:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-25 14:48:59,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 193
[2021-03-25 14:48:59,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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-25 14:48:59,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:48:59,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 193
[2021-03-25 14:48:59,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:48:59,872 INFO L129 PetriNetUnfolder]: 120/390 cut-off events.
[2021-03-25 14:48:59,872 INFO L130 PetriNetUnfolder]: For 1732/2411 co-relation queries the response was YES.
[2021-03-25 14:48:59,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 390 events. 120/390 cut-off events. For 1732/2411 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2680 event pairs, 12 based on Foata normal form. 244/609 useless extension candidates. Maximal degree in co-relation 1559. Up to 222 conditions per place.
[2021-03-25 14:48:59,876 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 15 changer transitions 3/51 dead transitions.
[2021-03-25 14:48:59,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 406 flow
[2021-03-25 14:48:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-25 14:48:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-25 14:48:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1194 transitions.
[2021-03-25 14:48:59,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8837897853441895
[2021-03-25 14:48:59,880 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1194 transitions.
[2021-03-25 14:48:59,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1194 transitions.
[2021-03-25 14:48:59,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:48:59,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1194 transitions.
[2021-03-25 14:48:59,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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-25 14:48:59,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:48:59,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:48:59,885 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 318 flow. Second operand 7 states and 1194 transitions.
[2021-03-25 14:48:59,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 406 flow
[2021-03-25 14:48:59,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:48:59,889 INFO L241 Difference]: Finished difference. Result has 63 places, 48 transitions, 397 flow
[2021-03-25 14:48:59,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=63, PETRI_TRANSITIONS=48}
[2021-03-25 14:48:59,890 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places.
[2021-03-25 14:48:59,890 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:48:59,890 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 48 transitions, 397 flow
[2021-03-25 14:48:59,890 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 48 transitions, 397 flow
[2021-03-25 14:48:59,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 48 transitions, 397 flow
[2021-03-25 14:48:59,929 INFO L129 PetriNetUnfolder]: 112/373 cut-off events.
[2021-03-25 14:48:59,929 INFO L130 PetriNetUnfolder]: For 1640/1763 co-relation queries the response was YES.
[2021-03-25 14:48:59,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 373 events. 112/373 cut-off events. For 1640/1763 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2570 event pairs, 13 based on Foata normal form. 23/377 useless extension candidates. Maximal degree in co-relation 1657. Up to 211 conditions per place.
[2021-03-25 14:48:59,935 INFO L142 LiptonReduction]: Number of co-enabled transitions 460
[2021-03-25 14:48:59,964 INFO L154 LiptonReduction]: Checked pairs total: 289
[2021-03-25 14:48:59,964 INFO L156 LiptonReduction]: Total number of compositions: 2
[2021-03-25 14:48:59,964 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74
[2021-03-25 14:48:59,964 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 381 flow
[2021-03-25 14:48:59,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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-25 14:48:59,965 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:59,965 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-25 14:48:59,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-03-25 14:48:59,965 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2056776132, now seen corresponding path program 1 times
[2021-03-25 14:48:59,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:59,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864796108]
[2021-03-25 14:48:59,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:49:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:49:00,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:49:00,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:49:00,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:49:00,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:49:00,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:49:00,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:49:00,088 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size
[2021-03-25 14:49:00,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-25 14:49:00,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:49:00,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:49:00,101 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-25 14:49:00,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864796108]
[2021-03-25 14:49:00,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:49:00,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-25 14:49:00,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773458519]
[2021-03-25 14:49:00,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-25 14:49:00,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:49:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-25 14:49:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-25 14:49:00,104 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 193
[2021-03-25 14:49:00,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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-25 14:49:00,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:49:00,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 193
[2021-03-25 14:49:00,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:49:00,187 INFO L129 PetriNetUnfolder]: 51/194 cut-off events.
[2021-03-25 14:49:00,187 INFO L130 PetriNetUnfolder]: For 1036/1150 co-relation queries the response was YES.
[2021-03-25 14:49:00,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 194 events. 51/194 cut-off events. For 1036/1150 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1013 event pairs, 3 based on Foata normal form. 67/255 useless extension candidates. Maximal degree in co-relation 855. Up to 96 conditions per place.
[2021-03-25 14:49:00,189 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 2 selfloop transitions, 11 changer transitions 8/44 dead transitions.
[2021-03-25 14:49:00,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 44 transitions, 386 flow
[2021-03-25 14:49:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-25 14:49:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-25 14:49:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1187 transitions.
[2021-03-25 14:49:00,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8786084381939304
[2021-03-25 14:49:00,193 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1187 transitions.
[2021-03-25 14:49:00,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1187 transitions.
[2021-03-25 14:49:00,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:49:00,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1187 transitions.
[2021-03-25 14:49:00,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.57142857142858) internal successors, (1187), 7 states have internal predecessors, (1187), 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-25 14:49:00,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:49:00,198 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-25 14:49:00,198 INFO L185 Difference]: Start difference. First operand has 63 places, 46 transitions, 381 flow. Second operand 7 states and 1187 transitions.
[2021-03-25 14:49:00,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 44 transitions, 386 flow
[2021-03-25 14:49:00,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 316 flow, removed 24 selfloop flow, removed 8 redundant places.
[2021-03-25 14:49:00,202 INFO L241 Difference]: Finished difference. Result has 59 places, 36 transitions, 254 flow
[2021-03-25 14:49:00,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=254, PETRI_PLACES=59, PETRI_TRANSITIONS=36}
[2021-03-25 14:49:00,203 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places.
[2021-03-25 14:49:00,203 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:49:00,203 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 36 transitions, 254 flow
[2021-03-25 14:49:00,203 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 36 transitions, 254 flow
[2021-03-25 14:49:00,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 254 flow
[2021-03-25 14:49:00,219 INFO L129 PetriNetUnfolder]: 27/119 cut-off events.
[2021-03-25 14:49:00,219 INFO L130 PetriNetUnfolder]: For 237/245 co-relation queries the response was YES.
[2021-03-25 14:49:00,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 119 events. 27/119 cut-off events. For 237/245 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 526 event pairs, 2 based on Foata normal form. 3/115 useless extension candidates. Maximal degree in co-relation 423. Up to 33 conditions per place.
[2021-03-25 14:49:00,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 162
[2021-03-25 14:49:02,043 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 297 DAG size of output: 246
[2021-03-25 14:49:02,376 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 222
[2021-03-25 14:49:05,402 WARN L205 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 406 DAG size of output: 326
[2021-03-25 14:49:06,130 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 301
[2021-03-25 14:49:06,507 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 195
[2021-03-25 14:49:06,866 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 190
[2021-03-25 14:49:08,381 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 274 DAG size of output: 273
[2021-03-25 14:49:09,113 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-25 14:49:09,647 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 232
[2021-03-25 14:49:10,108 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 232
[2021-03-25 14:49:10,936 WARN L205 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 311
[2021-03-25 14:49:11,785 WARN L205 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 311
[2021-03-25 14:49:11,791 INFO L154 LiptonReduction]: Checked pairs total: 128
[2021-03-25 14:49:11,791 INFO L156 LiptonReduction]: Total number of compositions: 7
[2021-03-25 14:49:11,791 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11588
[2021-03-25 14:49:11,792 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 242 flow
[2021-03-25 14:49:11,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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-25 14:49:11,792 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:49:11,793 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-25 14:49:11,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-03-25 14:49:11,793 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:49:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:49:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1271704254, now seen corresponding path program 1 times
[2021-03-25 14:49:11,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:49:11,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265712874]
[2021-03-25 14:49:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:49:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-25 14:49:11,862 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-25 14:49:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-25 14:49:11,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-25 14:49:11,997 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-25 14:49:11,997 INFO L634 BasicCegarLoop]: Counterexample might be feasible
[2021-03-25 14:49:11,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-03-25 14:49:12,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:49:12 BasicIcfg
[2021-03-25 14:49:12,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-25 14:49:12,130 INFO L168 Benchmark]: Toolchain (without parser) took 62553.82 ms. Allocated memory was 255.9 MB in the beginning and 528.5 MB in the end (delta: 272.6 MB). Free memory was 234.7 MB in the beginning and 336.7 MB in the end (delta: -102.0 MB). Peak memory consumption was 170.9 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,130 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.74 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 234.3 MB in the beginning and 290.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.38 ms. Allocated memory is still 333.4 MB. Free memory was 290.0 MB in the beginning and 287.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,131 INFO L168 Benchmark]: Boogie Preprocessor took 57.19 ms. Allocated memory is still 333.4 MB. Free memory was 287.2 MB in the beginning and 284.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,131 INFO L168 Benchmark]: RCFGBuilder took 3055.09 ms. Allocated memory was 333.4 MB in the beginning and 408.9 MB in the end (delta: 75.5 MB). Free memory was 283.9 MB in the beginning and 286.2 MB in the end (delta: -2.3 MB). Peak memory consumption was 110.7 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,132 INFO L168 Benchmark]: TraceAbstraction took 58791.70 ms. Allocated memory was 408.9 MB in the beginning and 528.5 MB in the end (delta: 119.5 MB). Free memory was 286.2 MB in the beginning and 336.7 MB in the end (delta: -50.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.0 GB.
[2021-03-25 14:49:12,133 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 561.74 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 234.3 MB in the beginning and 290.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 82.38 ms. Allocated memory is still 333.4 MB. Free memory was 290.0 MB in the beginning and 287.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 57.19 ms. Allocated memory is still 333.4 MB. Free memory was 287.2 MB in the beginning and 284.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 3055.09 ms. Allocated memory was 333.4 MB in the beginning and 408.9 MB in the end (delta: 75.5 MB). Free memory was 283.9 MB in the beginning and 286.2 MB in the end (delta: -2.3 MB). Peak memory consumption was 110.7 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 58791.70 ms. Allocated memory was 408.9 MB in the beginning and 528.5 MB in the end (delta: 119.5 MB). Free memory was 286.2 MB in the beginning and 336.7 MB in the end (delta: -50.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 25483.5ms, 108 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 38 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 938, positive: 860, positive conditional: 0, positive unconditional: 860, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 640, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 640, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 640, positive: 601, positive conditional: 0, positive unconditional: 601, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12374, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 358, negative conditional: 0, negative unconditional: 358, unknown: 11998, unknown conditional: 0, unknown unconditional: 11998] ], Cache Queries: [ total: 938, positive: 253, positive conditional: 0, positive unconditional: 253, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 640, unknown conditional: 0, unknown unconditional: 640] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 13805.4ms, 44 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 24 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 965 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 331, positive: 254, positive conditional: 0, positive unconditional: 254, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8962, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 8831, unknown conditional: 0, unknown unconditional: 8831] ], Cache Queries: [ total: 331, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1059.0ms, 34 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 645 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 235, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, positive: 178, positive conditional: 0, positive unconditional: 178, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1862.1ms, 33 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 400 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 170, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 46.4ms, 36 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 16.9ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 135 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 11.3ms, 42 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 18.0ms, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 23.3ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 84.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 125, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 121.4ms, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 73.8ms, 63 PlacesBefore, 63 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 11588.0ms, 59 PlacesBefore, 53 PlacesAfterwards, 36 TransitionsBefore, 32 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L714] 0 int __unbuffered_p0_EAX$mem_tmp;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L724] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L725] 0 int __unbuffered_p0_EAX$w_buff0;
[L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727] 0 int __unbuffered_p0_EAX$w_buff1;
[L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730] 0 int __unbuffered_p0_EBX = 0;
[L732] 0 int __unbuffered_p2_EAX = 0;
[L733] 0 _Bool main$tmp_guard0;
[L734] 0 _Bool main$tmp_guard1;
[L736] 0 int x = 0;
[L738] 0 int y = 0;
[L739] 0 _Bool y$flush_delayed;
[L740] 0 int y$mem_tmp;
[L741] 0 _Bool y$r_buff0_thd0;
[L742] 0 _Bool y$r_buff0_thd1;
[L743] 0 _Bool y$r_buff0_thd2;
[L744] 0 _Bool y$r_buff0_thd3;
[L745] 0 _Bool y$r_buff1_thd0;
[L746] 0 _Bool y$r_buff1_thd1;
[L747] 0 _Bool y$r_buff1_thd2;
[L748] 0 _Bool y$r_buff1_thd3;
[L749] 0 _Bool y$read_delayed;
[L750] 0 int *y$read_delayed_var;
[L751] 0 int y$w_buff0;
[L752] 0 _Bool y$w_buff0_used;
[L753] 0 int y$w_buff1;
[L754] 0 _Bool y$w_buff1_used;
[L755] 0 _Bool weak$$choice0;
[L756] 0 _Bool weak$$choice1;
[L757] 0 _Bool weak$$choice2;
[L852] 0 pthread_t t1837;
[L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7: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]
[L761] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L762] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L763] 1 y$flush_delayed = weak$$choice2
[L764] EXPR 1 \read(y)
[L764] 1 y$mem_tmp = y
[L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L765] EXPR 1 \read(y)
[L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y
[L774] EXPR 1 \read(y)
[L774] 1 __unbuffered_p0_EAX = y
[L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L775] EXPR 1 \read(y)
[L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L775] 1 y = y$flush_delayed ? y$mem_tmp : y
[L776] 1 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7: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]
[L854] 0 pthread_t t1838;
[L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L856] 0 pthread_t t1839;
[L779] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7: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]
[L791] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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]
[L794] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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]
[L797] 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)
[L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L797] EXPR 2 \read(y)
[L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L797] 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)
[L797] 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)
[L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L799] 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
[L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L801] 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
[L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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]
[L811] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L812] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L813] 3 y$flush_delayed = weak$$choice2
[L814] EXPR 3 \read(y)
[L814] 3 y$mem_tmp = y
[L815] 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)
[L815] EXPR 3 \read(y)
[L815] 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)
[L815] 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)
[L816] 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))
[L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L816] 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))
[L816] 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))
[L817] 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))
[L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L817] 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))
[L817] 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))
[L818] 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))
[L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L818] 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))
[L818] 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))
[L819] 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))
[L819] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L819] 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))
[L819] 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))
[L820] 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))
[L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L820] 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))
[L820] 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))
[L821] 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))
[L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L821] 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))
[L821] 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))
[L822] EXPR 3 \read(y)
[L822] 3 __unbuffered_p2_EAX = y
[L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L823] EXPR 3 \read(y)
[L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L823] 3 y = y$flush_delayed ? y$mem_tmp : y
[L824] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L827] 3 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=1, 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]
[L830] 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)
[L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L830] EXPR 3 \read(y)
[L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L830] 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)
[L830] 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)
[L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L832] 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
[L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L834] 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
[L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L786] 1 return 0;
[L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L806] 2 return 0;
[L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L839] 3 return 0;
[L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L4] COND FALSE 0 !(!cond)
[L863] 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)
[L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L863] EXPR 0 \read(y)
[L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L863] 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)
[L863] 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)
[L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L865] 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
[L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L867] 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
[L870] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L871] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L872] 0 y$flush_delayed = weak$$choice2
[L873] EXPR 0 \read(y)
[L873] 0 y$mem_tmp = y
[L874] 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)
[L874] EXPR 0 \read(y)
[L874] 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)
[L874] 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)
[L875] 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))
[L875] 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))
[L876] 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))
[L876] 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))
[L877] 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))
[L877] 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))
[L878] 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))
[L878] 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))
[L879] 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))
[L879] 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))
[L880] 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))
[L880] 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))
[L881] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L883] EXPR 0 \read(y)
[L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y
[L884] 0 y = y$flush_delayed ? y$mem_tmp : y
[L885] 0 y$flush_delayed = (_Bool)0
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, 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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 58504.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1728.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25575.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 29 SDslu, 23 SDs, 0 SdLazy, 281 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 537.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 758.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=11, InterpolantAutomatonStates: 57, 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: 52.8ms SsaConstructionTime, 783.1ms SatisfiabilityAnalysisTime, 1288.6ms InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...