/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8
[2021-03-11 02:31:01,109 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-03-11 02:31:01,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-11 02:31:01,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-11 02:31:01,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-11 02:31:01,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-11 02:31:01,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-11 02:31:01,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-11 02:31:01,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-11 02:31:01,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-11 02:31:01,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-03-11 02:31:01,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-11 02:31:01,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-11 02:31:01,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-11 02:31:01,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-11 02:31:01,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-11 02:31:01,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-11 02:31:01,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-11 02:31:01,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-11 02:31:01,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-11 02:31:01,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-11 02:31:01,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-11 02:31:01,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-03-11 02:31:01,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-11 02:31:01,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-11 02:31:01,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-11 02:31:01,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-11 02:31:01,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-11 02:31:01,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-11 02:31:01,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-11 02:31:01,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-11 02:31:01,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-11 02:31:01,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-11 02:31:01,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-11 02:31:01,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-11 02:31:01,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-11 02:31:01,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-11 02:31:01,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-11 02:31:01,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-11 02:31:01,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-11 02:31:01,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-03-11 02:31:01,182 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-NoLbe.epf
[2021-03-11 02:31:01,196 INFO L113 SettingsManager]: Loading preferences was successful
[2021-03-11 02:31:01,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-11 02:31:01,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-11 02:31:01,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-03-11 02:31:01,198 INFO L138 SettingsManager]: * Use SBE=true
[2021-03-11 02:31:01,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-11 02:31:01,198 INFO L138 SettingsManager]: * sizeof long=4
[2021-03-11 02:31:01,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-03-11 02:31:01,198 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * sizeof long double=12
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-03-11 02:31:01,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-03-11 02:31:01,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-11 02:31:01,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-11 02:31:01,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-03-11 02:31:01,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-11 02:31:01,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-03-11 02:31:01,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-11 02:31:01,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-11 02:31:01,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-11 02:31:01,457 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-03-11 02:31:01,457 INFO L275 PluginConnector]: CDTParser initialized
[2021-03-11 02:31:01,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i
[2021-03-11 02:31:01,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfab788f9/8fd6b272e43547c8b1c736af99743b84/FLAGf4d29cba8
[2021-03-11 02:31:01,907 INFO L306 CDTParser]: Found 1 translation units.
[2021-03-11 02:31:01,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i
[2021-03-11 02:31:01,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfab788f9/8fd6b272e43547c8b1c736af99743b84/FLAGf4d29cba8
[2021-03-11 02:31:02,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfab788f9/8fd6b272e43547c8b1c736af99743b84
[2021-03-11 02:31:02,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-11 02:31:02,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-11 02:31:02,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-11 02:31:02,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-11 02:31:02,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-11 02:31:02,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0d3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02, skipping insertion in model container
[2021-03-11 02:31:02,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-03-11 02:31:02,313 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-03-11 02:31:02,403 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/safe004_rmo.opt.i[949,962]
[2021-03-11 02:31:02,573 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-11 02:31:02,579 INFO L203 MainTranslator]: Completed pre-run
[2021-03-11 02:31:02,586 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/safe004_rmo.opt.i[949,962]
[2021-03-11 02:31:02,621 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-11 02:31:02,672 INFO L208 MainTranslator]: Completed translation
[2021-03-11 02:31:02,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02 WrapperNode
[2021-03-11 02:31:02,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-11 02:31:02,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-11 02:31:02,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-11 02:31:02,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-11 02:31:02,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-11 02:31:02,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-11 02:31:02,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-11 02:31:02,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-03-11 02:31:02,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
[2021-03-11 02:31:02,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-11 02:31:02,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-11 02:31:02,749 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-03-11 02:31:02,749 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-03-11 02:31:02,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-03-11 02:31:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-03-11 02:31:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-03-11 02:31:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-03-11 02:31:02,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-03-11 02:31:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-11 02:31:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-11 02:31:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-11 02:31:02,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-11 02:31:02,807 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-11 02:31:04,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-11 02:31:04,111 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-03-11 02:31:04,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:31:04 BoogieIcfgContainer
[2021-03-11 02:31:04,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-11 02:31:04,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-11 02:31:04,115 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-03-11 02:31:04,117 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-03-11 02:31:04,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:31:02" (1/3) ...
[2021-03-11 02:31:04,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372567f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:31:04, skipping insertion in model container
[2021-03-11 02:31:04,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:31:02" (2/3) ...
[2021-03-11 02:31:04,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372567f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:31:04, skipping insertion in model container
[2021-03-11 02:31:04,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:31:04" (3/3) ...
[2021-03-11 02:31:04,119 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i
[2021-03-11 02:31:04,123 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-11 02:31:04,126 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-03-11 02:31:04,127 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-11 02:31:04,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,168 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 02:31:04,177 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-11 02:31:04,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-03-11 02:31:04,209 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-03-11 02:31:04,209 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-03-11 02:31:04,209 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-11 02:31:04,209 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-11 02:31:04,210 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-11 02:31:04,210 INFO L381 AbstractCegarLoop]: Difference is false
[2021-03-11 02:31:04,210 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-11 02:31:04,210 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-11 02:31:04,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow
[2021-03-11 02:31:04,250 INFO L129 PetriNetUnfolder]: 2/94 cut-off events.
[2021-03-11 02:31:04,251 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 02:31:04,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place.
[2021-03-11 02:31:04,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow
[2021-03-11 02:31:04,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow
[2021-03-11 02:31:04,275 INFO L129 PetriNetUnfolder]: 0/50 cut-off events.
[2021-03-11 02:31:04,276 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 02:31:04,276 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:04,276 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:04,277 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2048644392, now seen corresponding path program 1 times
[2021-03-11 02:31:04,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:04,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286608761]
[2021-03-11 02:31:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:04,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:04,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:04,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286608761]
[2021-03-11 02:31:04,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:04,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-11 02:31:04,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598272256]
[2021-03-11 02:31:04,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 02:31:04,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:04,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 02:31:04,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 02:31:04,539 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97
[2021-03-11 02:31:04,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:04,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97
[2021-03-11 02:31:04,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:04,625 INFO L129 PetriNetUnfolder]: 49/379 cut-off events.
[2021-03-11 02:31:04,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 02:31:04,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 379 events. 49/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1972 event pairs, 27 based on Foata normal form. 18/374 useless extension candidates. Maximal degree in co-relation 430. Up to 65 conditions per place.
[2021-03-11 02:31:04,630 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 9 selfloop transitions, 2 changer transitions 0/94 dead transitions.
[2021-03-11 02:31:04,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 219 flow
[2021-03-11 02:31:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-03-11 02:31:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-11 02:31:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions.
[2021-03-11 02:31:04,639 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9415807560137457
[2021-03-11 02:31:04,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions.
[2021-03-11 02:31:04,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions.
[2021-03-11 02:31:04,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:04,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions.
[2021-03-11 02:31:04,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,651 INFO L185 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 3 states and 274 transitions.
[2021-03-11 02:31:04,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 219 flow
[2021-03-11 02:31:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-11 02:31:04,656 INFO L241 Difference]: Finished difference. Result has 99 places, 90 transitions, 190 flow
[2021-03-11 02:31:04,657 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=99, PETRI_TRANSITIONS=90}
[2021-03-11 02:31:04,658 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places.
[2021-03-11 02:31:04,658 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 190 flow
[2021-03-11 02:31:04,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,658 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:04,658 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:04,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-11 02:31:04,658 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1423014716, now seen corresponding path program 1 times
[2021-03-11 02:31:04,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:04,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835875197]
[2021-03-11 02:31:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:04,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:04,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:04,795 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:04,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:04,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:04,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:04,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:04,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:04,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835875197]
[2021-03-11 02:31:04,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:04,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 02:31:04,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115026988]
[2021-03-11 02:31:04,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 02:31:04,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:04,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 02:31:04,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-03-11 02:31:04,841 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 97
[2021-03-11 02:31:04,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:04,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:04,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 97
[2021-03-11 02:31:04,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:05,049 INFO L129 PetriNetUnfolder]: 172/664 cut-off events.
[2021-03-11 02:31:05,049 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 02:31:05,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 664 events. 172/664 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4156 event pairs, 56 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 929. Up to 146 conditions per place.
[2021-03-11 02:31:05,055 INFO L132 encePairwiseOnDemand]: 90/97 looper letters, 12 selfloop transitions, 3 changer transitions 43/127 dead transitions.
[2021-03-11 02:31:05,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 362 flow
[2021-03-11 02:31:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-03-11 02:31:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 02:31:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 789 transitions.
[2021-03-11 02:31:05,062 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9037800687285223
[2021-03-11 02:31:05,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 789 transitions.
[2021-03-11 02:31:05,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 789 transitions.
[2021-03-11 02:31:05,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:05,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 789 transitions.
[2021-03-11 02:31:05,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,068 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,069 INFO L185 Difference]: Start difference. First operand has 99 places, 90 transitions, 190 flow. Second operand 9 states and 789 transitions.
[2021-03-11 02:31:05,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 362 flow
[2021-03-11 02:31:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-11 02:31:05,072 INFO L241 Difference]: Finished difference. Result has 112 places, 82 transitions, 209 flow
[2021-03-11 02:31:05,072 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=112, PETRI_TRANSITIONS=82}
[2021-03-11 02:31:05,073 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places.
[2021-03-11 02:31:05,073 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 209 flow
[2021-03-11 02:31:05,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,073 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:05,073 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:05,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-11 02:31:05,073 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1125033885, now seen corresponding path program 1 times
[2021-03-11 02:31:05,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:05,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706874942]
[2021-03-11 02:31:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:05,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:05,173 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:05,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:05,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:05,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706874942]
[2021-03-11 02:31:05,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:05,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 02:31:05,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492251575]
[2021-03-11 02:31:05,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 02:31:05,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 02:31:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-03-11 02:31:05,198 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97
[2021-03-11 02:31:05,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 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-11 02:31:05,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:05,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97
[2021-03-11 02:31:05,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:05,275 INFO L129 PetriNetUnfolder]: 28/176 cut-off events.
[2021-03-11 02:31:05,275 INFO L130 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES.
[2021-03-11 02:31:05,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 176 events. 28/176 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 538 event pairs, 9 based on Foata normal form. 6/176 useless extension candidates. Maximal degree in co-relation 342. Up to 31 conditions per place.
[2021-03-11 02:31:05,276 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 6 selfloop transitions, 2 changer transitions 10/92 dead transitions.
[2021-03-11 02:31:05,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 283 flow
[2021-03-11 02:31:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-03-11 02:31:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 02:31:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions.
[2021-03-11 02:31:05,278 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8991981672394044
[2021-03-11 02:31:05,278 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions.
[2021-03-11 02:31:05,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions.
[2021-03-11 02:31:05,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:05,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions.
[2021-03-11 02:31:05,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,281 INFO L185 Difference]: Start difference. First operand has 112 places, 82 transitions, 209 flow. Second operand 9 states and 785 transitions.
[2021-03-11 02:31:05,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 92 transitions, 283 flow
[2021-03-11 02:31:05,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 92 transitions, 266 flow, removed 7 selfloop flow, removed 4 redundant places.
[2021-03-11 02:31:05,284 INFO L241 Difference]: Finished difference. Result has 107 places, 82 transitions, 220 flow
[2021-03-11 02:31:05,285 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=107, PETRI_TRANSITIONS=82}
[2021-03-11 02:31:05,285 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places.
[2021-03-11 02:31:05,285 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 220 flow
[2021-03-11 02:31:05,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 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-11 02:31:05,285 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:05,285 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:05,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-11 02:31:05,285 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash 303581911, now seen corresponding path program 1 times
[2021-03-11 02:31:05,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:05,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337244856]
[2021-03-11 02:31:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:05,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:05,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 02:31:05,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 02:31:05,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 02:31:05,412 INFO L142 QuantifierPusher]: treesize reduction 27, result has 74.0 percent of original size
[2021-03-11 02:31:05,417 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.3 percent of original size 68
[2021-03-11 02:31:05,442 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:05,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:05,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337244856]
[2021-03-11 02:31:05,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:05,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-03-11 02:31:05,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299585313]
[2021-03-11 02:31:05,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-03-11 02:31:05,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:05,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-03-11 02:31:05,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-03-11 02:31:05,477 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97
[2021-03-11 02:31:05,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 220 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:05,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97
[2021-03-11 02:31:05,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:05,848 INFO L129 PetriNetUnfolder]: 425/919 cut-off events.
[2021-03-11 02:31:05,849 INFO L130 PetriNetUnfolder]: For 1047/1047 co-relation queries the response was YES.
[2021-03-11 02:31:05,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 919 events. 425/919 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5033 event pairs, 202 based on Foata normal form. 28/914 useless extension candidates. Maximal degree in co-relation 2241. Up to 380 conditions per place.
[2021-03-11 02:31:05,856 INFO L132 encePairwiseOnDemand]: 85/97 looper letters, 14 selfloop transitions, 10 changer transitions 44/134 dead transitions.
[2021-03-11 02:31:05,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 504 flow
[2021-03-11 02:31:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-03-11 02:31:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-03-11 02:31:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1211 transitions.
[2021-03-11 02:31:05,860 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8323024054982818
[2021-03-11 02:31:05,860 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1211 transitions.
[2021-03-11 02:31:05,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1211 transitions.
[2021-03-11 02:31:05,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:05,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1211 transitions.
[2021-03-11 02:31:05,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 80.73333333333333) internal successors, (1211), 15 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,864 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,864 INFO L185 Difference]: Start difference. First operand has 107 places, 82 transitions, 220 flow. Second operand 15 states and 1211 transitions.
[2021-03-11 02:31:05,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 504 flow
[2021-03-11 02:31:05,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 134 transitions, 464 flow, removed 18 selfloop flow, removed 8 redundant places.
[2021-03-11 02:31:05,870 INFO L241 Difference]: Finished difference. Result has 118 places, 88 transitions, 288 flow
[2021-03-11 02:31:05,870 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=288, PETRI_PLACES=118, PETRI_TRANSITIONS=88}
[2021-03-11 02:31:05,870 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 16 predicate places.
[2021-03-11 02:31:05,870 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 288 flow
[2021-03-11 02:31:05,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,870 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:05,871 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:05,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-11 02:31:05,871 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1573479955, now seen corresponding path program 1 times
[2021-03-11 02:31:05,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:05,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780872991]
[2021-03-11 02:31:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:05,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:05,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:05,918 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:05,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:05,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:05,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:05,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:05,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780872991]
[2021-03-11 02:31:05,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:05,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 02:31:05,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637194916]
[2021-03-11 02:31:05,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 02:31:05,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 02:31:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-03-11 02:31:05,955 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97
[2021-03-11 02:31:05,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:05,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:05,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97
[2021-03-11 02:31:05,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:06,079 INFO L129 PetriNetUnfolder]: 102/401 cut-off events.
[2021-03-11 02:31:06,079 INFO L130 PetriNetUnfolder]: For 1412/1613 co-relation queries the response was YES.
[2021-03-11 02:31:06,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 401 events. 102/401 cut-off events. For 1412/1613 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2173 event pairs, 41 based on Foata normal form. 17/404 useless extension candidates. Maximal degree in co-relation 1354. Up to 92 conditions per place.
[2021-03-11 02:31:06,082 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 12 selfloop transitions, 5 changer transitions 11/102 dead transitions.
[2021-03-11 02:31:06,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 461 flow
[2021-03-11 02:31:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-11 02:31:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 02:31:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 596 transitions.
[2021-03-11 02:31:06,084 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8777614138438881
[2021-03-11 02:31:06,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 596 transitions.
[2021-03-11 02:31:06,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 596 transitions.
[2021-03-11 02:31:06,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:06,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 596 transitions.
[2021-03-11 02:31:06,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,088 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,088 INFO L185 Difference]: Start difference. First operand has 118 places, 88 transitions, 288 flow. Second operand 7 states and 596 transitions.
[2021-03-11 02:31:06,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 461 flow
[2021-03-11 02:31:06,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 447 flow, removed 5 selfloop flow, removed 5 redundant places.
[2021-03-11 02:31:06,094 INFO L241 Difference]: Finished difference. Result has 114 places, 88 transitions, 301 flow
[2021-03-11 02:31:06,094 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=114, PETRI_TRANSITIONS=88}
[2021-03-11 02:31:06,094 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 12 predicate places.
[2021-03-11 02:31:06,095 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 88 transitions, 301 flow
[2021-03-11 02:31:06,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,095 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:06,095 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:06,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-11 02:31:06,095 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash 886252633, now seen corresponding path program 2 times
[2021-03-11 02:31:06,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:06,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536368168]
[2021-03-11 02:31:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:06,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:06,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:06,189 INFO L142 QuantifierPusher]: treesize reduction 27, result has 57.8 percent of original size
[2021-03-11 02:31:06,191 INFO L147 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size 28
[2021-03-11 02:31:06,205 INFO L142 QuantifierPusher]: treesize reduction 28, result has 58.8 percent of original size
[2021-03-11 02:31:06,206 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31
[2021-03-11 02:31:06,220 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:06,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:06,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:06,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:06,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:06,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536368168]
[2021-03-11 02:31:06,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:06,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-03-11 02:31:06,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715299700]
[2021-03-11 02:31:06,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 02:31:06,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 02:31:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2021-03-11 02:31:06,260 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 97
[2021-03-11 02:31:06,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 88 transitions, 301 flow. Second operand has 8 states, 8 states have (on average 79.25) internal successors, (634), 8 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:06,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 97
[2021-03-11 02:31:06,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:06,656 INFO L129 PetriNetUnfolder]: 362/825 cut-off events.
[2021-03-11 02:31:06,656 INFO L130 PetriNetUnfolder]: For 2589/2621 co-relation queries the response was YES.
[2021-03-11 02:31:06,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 825 events. 362/825 cut-off events. For 2589/2621 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4380 event pairs, 116 based on Foata normal form. 22/820 useless extension candidates. Maximal degree in co-relation 2771. Up to 321 conditions per place.
[2021-03-11 02:31:06,664 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 28 selfloop transitions, 9 changer transitions 37/142 dead transitions.
[2021-03-11 02:31:06,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 142 transitions, 777 flow
[2021-03-11 02:31:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-03-11 02:31:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-03-11 02:31:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1085 transitions.
[2021-03-11 02:31:06,667 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8604282315622522
[2021-03-11 02:31:06,667 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1085 transitions.
[2021-03-11 02:31:06,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1085 transitions.
[2021-03-11 02:31:06,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:06,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1085 transitions.
[2021-03-11 02:31:06,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 83.46153846153847) internal successors, (1085), 13 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,672 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,672 INFO L185 Difference]: Start difference. First operand has 114 places, 88 transitions, 301 flow. Second operand 13 states and 1085 transitions.
[2021-03-11 02:31:06,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 142 transitions, 777 flow
[2021-03-11 02:31:06,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 731 flow, removed 18 selfloop flow, removed 6 redundant places.
[2021-03-11 02:31:06,677 INFO L241 Difference]: Finished difference. Result has 128 places, 93 transitions, 377 flow
[2021-03-11 02:31:06,677 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=377, PETRI_PLACES=128, PETRI_TRANSITIONS=93}
[2021-03-11 02:31:06,677 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 26 predicate places.
[2021-03-11 02:31:06,677 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 93 transitions, 377 flow
[2021-03-11 02:31:06,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 79.25) internal successors, (634), 8 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,678 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:06,678 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:06,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-11 02:31:06,678 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash -540707989, now seen corresponding path program 3 times
[2021-03-11 02:31:06,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:06,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338994683]
[2021-03-11 02:31:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:06,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:06,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:06,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:06,753 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:06,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:06,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:06,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:06,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:06,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:06,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338994683]
[2021-03-11 02:31:06,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:06,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 02:31:06,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783631626]
[2021-03-11 02:31:06,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 02:31:06,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 02:31:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-03-11 02:31:06,779 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97
[2021-03-11 02:31:06,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 93 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:06,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:06,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97
[2021-03-11 02:31:06,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:07,006 INFO L129 PetriNetUnfolder]: 365/1075 cut-off events.
[2021-03-11 02:31:07,006 INFO L130 PetriNetUnfolder]: For 6462/6649 co-relation queries the response was YES.
[2021-03-11 02:31:07,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4463 conditions, 1075 events. 365/1075 cut-off events. For 6462/6649 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7450 event pairs, 192 based on Foata normal form. 44/1082 useless extension candidates. Maximal degree in co-relation 4387. Up to 315 conditions per place.
[2021-03-11 02:31:07,016 INFO L132 encePairwiseOnDemand]: 90/97 looper letters, 18 selfloop transitions, 8 changer transitions 10/112 dead transitions.
[2021-03-11 02:31:07,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 112 transitions, 629 flow
[2021-03-11 02:31:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-03-11 02:31:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-03-11 02:31:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 925 transitions.
[2021-03-11 02:31:07,018 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8669165885660731
[2021-03-11 02:31:07,018 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 925 transitions.
[2021-03-11 02:31:07,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 925 transitions.
[2021-03-11 02:31:07,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:07,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 925 transitions.
[2021-03-11 02:31:07,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.0909090909091) internal successors, (925), 11 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,021 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,022 INFO L185 Difference]: Start difference. First operand has 128 places, 93 transitions, 377 flow. Second operand 11 states and 925 transitions.
[2021-03-11 02:31:07,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 112 transitions, 629 flow
[2021-03-11 02:31:07,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 112 transitions, 567 flow, removed 29 selfloop flow, removed 7 redundant places.
[2021-03-11 02:31:07,031 INFO L241 Difference]: Finished difference. Result has 131 places, 95 transitions, 423 flow
[2021-03-11 02:31:07,032 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=423, PETRI_PLACES=131, PETRI_TRANSITIONS=95}
[2021-03-11 02:31:07,032 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 29 predicate places.
[2021-03-11 02:31:07,032 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 95 transitions, 423 flow
[2021-03-11 02:31:07,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,032 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:07,032 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:07,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-11 02:31:07,033 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1208610591, now seen corresponding path program 1 times
[2021-03-11 02:31:07,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:07,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762722281]
[2021-03-11 02:31:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:07,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,100 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:07,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:07,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:07,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762722281]
[2021-03-11 02:31:07,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:07,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 02:31:07,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796061731]
[2021-03-11 02:31:07,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 02:31:07,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 02:31:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-03-11 02:31:07,125 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 97
[2021-03-11 02:31:07,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 95 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:07,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 97
[2021-03-11 02:31:07,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:07,307 INFO L129 PetriNetUnfolder]: 242/861 cut-off events.
[2021-03-11 02:31:07,307 INFO L130 PetriNetUnfolder]: For 5175/5349 co-relation queries the response was YES.
[2021-03-11 02:31:07,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 861 events. 242/861 cut-off events. For 5175/5349 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6099 event pairs, 146 based on Foata normal form. 35/862 useless extension candidates. Maximal degree in co-relation 3309. Up to 245 conditions per place.
[2021-03-11 02:31:07,313 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 10 selfloop transitions, 2 changer transitions 22/106 dead transitions.
[2021-03-11 02:31:07,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 106 transitions, 598 flow
[2021-03-11 02:31:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-03-11 02:31:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-11 02:31:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions.
[2021-03-11 02:31:07,315 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8751431844215349
[2021-03-11 02:31:07,315 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 764 transitions.
[2021-03-11 02:31:07,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 764 transitions.
[2021-03-11 02:31:07,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:07,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 764 transitions.
[2021-03-11 02:31:07,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.88888888888889) internal successors, (764), 9 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,318 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,318 INFO L185 Difference]: Start difference. First operand has 131 places, 95 transitions, 423 flow. Second operand 9 states and 764 transitions.
[2021-03-11 02:31:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 106 transitions, 598 flow
[2021-03-11 02:31:07,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 106 transitions, 524 flow, removed 34 selfloop flow, removed 7 redundant places.
[2021-03-11 02:31:07,326 INFO L241 Difference]: Finished difference. Result has 136 places, 83 transitions, 306 flow
[2021-03-11 02:31:07,326 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=136, PETRI_TRANSITIONS=83}
[2021-03-11 02:31:07,326 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 34 predicate places.
[2021-03-11 02:31:07,326 INFO L480 AbstractCegarLoop]: Abstraction has has 136 places, 83 transitions, 306 flow
[2021-03-11 02:31:07,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,326 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:07,326 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:07,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-11 02:31:07,326 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2018742993, now seen corresponding path program 1 times
[2021-03-11 02:31:07,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:07,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419690291]
[2021-03-11 02:31:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:07,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,384 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:07,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:07,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:07,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419690291]
[2021-03-11 02:31:07,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:07,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 02:31:07,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241616608]
[2021-03-11 02:31:07,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 02:31:07,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 02:31:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-03-11 02:31:07,412 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97
[2021-03-11 02:31:07,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 83 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:07,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97
[2021-03-11 02:31:07,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:07,517 INFO L129 PetriNetUnfolder]: 150/490 cut-off events.
[2021-03-11 02:31:07,517 INFO L130 PetriNetUnfolder]: For 2917/3033 co-relation queries the response was YES.
[2021-03-11 02:31:07,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 490 events. 150/490 cut-off events. For 2917/3033 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2622 event pairs, 103 based on Foata normal form. 14/477 useless extension candidates. Maximal degree in co-relation 1856. Up to 162 conditions per place.
[2021-03-11 02:31:07,521 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 8 selfloop transitions, 4 changer transitions 7/90 dead transitions.
[2021-03-11 02:31:07,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 90 transitions, 413 flow
[2021-03-11 02:31:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-11 02:31:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 02:31:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions.
[2021-03-11 02:31:07,523 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8645066273932254
[2021-03-11 02:31:07,523 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 587 transitions.
[2021-03-11 02:31:07,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 587 transitions.
[2021-03-11 02:31:07,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:07,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 587 transitions.
[2021-03-11 02:31:07,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,525 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,525 INFO L185 Difference]: Start difference. First operand has 136 places, 83 transitions, 306 flow. Second operand 7 states and 587 transitions.
[2021-03-11 02:31:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 90 transitions, 413 flow
[2021-03-11 02:31:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 90 transitions, 334 flow, removed 33 selfloop flow, removed 20 redundant places.
[2021-03-11 02:31:07,529 INFO L241 Difference]: Finished difference. Result has 114 places, 83 transitions, 276 flow
[2021-03-11 02:31:07,529 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=114, PETRI_TRANSITIONS=83}
[2021-03-11 02:31:07,529 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 12 predicate places.
[2021-03-11 02:31:07,530 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 276 flow
[2021-03-11 02:31:07,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,530 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:07,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:07,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-11 02:31:07,530 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1573994206, now seen corresponding path program 1 times
[2021-03-11 02:31:07,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:07,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359569366]
[2021-03-11 02:31:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:07,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,572 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 02:31:07,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 02:31:07,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 02:31:07,589 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-03-11 02:31:07,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:07,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359569366]
[2021-03-11 02:31:07,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:07,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 02:31:07,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315224177]
[2021-03-11 02:31:07,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 02:31:07,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 02:31:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-03-11 02:31:07,598 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97
[2021-03-11 02:31:07,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:07,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97
[2021-03-11 02:31:07,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:07,730 INFO L129 PetriNetUnfolder]: 323/923 cut-off events.
[2021-03-11 02:31:07,730 INFO L130 PetriNetUnfolder]: For 1058/1060 co-relation queries the response was YES.
[2021-03-11 02:31:07,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2182 conditions, 923 events. 323/923 cut-off events. For 1058/1060 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6443 event pairs, 90 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 2115. Up to 186 conditions per place.
[2021-03-11 02:31:07,736 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 24 selfloop transitions, 17 changer transitions 0/113 dead transitions.
[2021-03-11 02:31:07,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 418 flow
[2021-03-11 02:31:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-03-11 02:31:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-03-11 02:31:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions.
[2021-03-11 02:31:07,757 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9
[2021-03-11 02:31:07,757 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions.
[2021-03-11 02:31:07,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions.
[2021-03-11 02:31:07,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:07,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions.
[2021-03-11 02:31:07,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,760 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,760 INFO L185 Difference]: Start difference. First operand has 114 places, 83 transitions, 276 flow. Second operand 10 states and 873 transitions.
[2021-03-11 02:31:07,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 418 flow
[2021-03-11 02:31:07,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 400 flow, removed 4 selfloop flow, removed 7 redundant places.
[2021-03-11 02:31:07,763 INFO L241 Difference]: Finished difference. Result has 119 places, 98 transitions, 378 flow
[2021-03-11 02:31:07,763 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=119, PETRI_TRANSITIONS=98}
[2021-03-11 02:31:07,764 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 17 predicate places.
[2021-03-11 02:31:07,764 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 98 transitions, 378 flow
[2021-03-11 02:31:07,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,764 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:07,764 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:07,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-11 02:31:07,764 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash -930834254, now seen corresponding path program 1 times
[2021-03-11 02:31:07,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:07,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116893056]
[2021-03-11 02:31:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:07,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:07,803 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 02:31:07,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 02:31:07,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 02:31:07,819 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-03-11 02:31:07,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:07,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:07,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:07,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116893056]
[2021-03-11 02:31:07,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:07,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 02:31:07,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735635950]
[2021-03-11 02:31:07,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 02:31:07,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 02:31:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-03-11 02:31:07,827 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97
[2021-03-11 02:31:07,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 98 transitions, 378 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:07,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:07,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97
[2021-03-11 02:31:07,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:07,990 INFO L129 PetriNetUnfolder]: 243/801 cut-off events.
[2021-03-11 02:31:07,990 INFO L130 PetriNetUnfolder]: For 1561/2010 co-relation queries the response was YES.
[2021-03-11 02:31:07,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 801 events. 243/801 cut-off events. For 1561/2010 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 5821 event pairs, 12 based on Foata normal form. 120/864 useless extension candidates. Maximal degree in co-relation 2454. Up to 235 conditions per place.
[2021-03-11 02:31:07,995 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 20 selfloop transitions, 32 changer transitions 9/133 dead transitions.
[2021-03-11 02:31:07,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 133 transitions, 724 flow
[2021-03-11 02:31:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-03-11 02:31:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-03-11 02:31:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1136 transitions.
[2021-03-11 02:31:07,998 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9008723235527359
[2021-03-11 02:31:07,998 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1136 transitions.
[2021-03-11 02:31:07,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1136 transitions.
[2021-03-11 02:31:07,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:07,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1136 transitions.
[2021-03-11 02:31:08,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.38461538461539) internal successors, (1136), 13 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,004 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,005 INFO L185 Difference]: Start difference. First operand has 119 places, 98 transitions, 378 flow. Second operand 13 states and 1136 transitions.
[2021-03-11 02:31:08,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 133 transitions, 724 flow
[2021-03-11 02:31:08,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 133 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-11 02:31:08,012 INFO L241 Difference]: Finished difference. Result has 134 places, 118 transitions, 619 flow
[2021-03-11 02:31:08,012 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=619, PETRI_PLACES=134, PETRI_TRANSITIONS=118}
[2021-03-11 02:31:08,012 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 32 predicate places.
[2021-03-11 02:31:08,012 INFO L480 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 619 flow
[2021-03-11 02:31:08,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,012 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:08,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:08,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-03-11 02:31:08,013 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1674448153, now seen corresponding path program 1 times
[2021-03-11 02:31:08,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:08,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486595008]
[2021-03-11 02:31:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:08,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:08,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:08,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:08,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:08,075 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 02:31:08,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 02:31:08,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 02:31:08,092 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-03-11 02:31:08,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:08,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:08,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486595008]
[2021-03-11 02:31:08,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:08,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-03-11 02:31:08,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355881228]
[2021-03-11 02:31:08,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 02:31:08,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 02:31:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-03-11 02:31:08,105 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97
[2021-03-11 02:31:08,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 619 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:08,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97
[2021-03-11 02:31:08,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:08,317 INFO L129 PetriNetUnfolder]: 197/711 cut-off events.
[2021-03-11 02:31:08,317 INFO L130 PetriNetUnfolder]: For 2996/3921 co-relation queries the response was YES.
[2021-03-11 02:31:08,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 711 events. 197/711 cut-off events. For 2996/3921 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 5399 event pairs, 2 based on Foata normal form. 140/795 useless extension candidates. Maximal degree in co-relation 2575. Up to 197 conditions per place.
[2021-03-11 02:31:08,322 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 16 selfloop transitions, 36 changer transitions 20/144 dead transitions.
[2021-03-11 02:31:08,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 937 flow
[2021-03-11 02:31:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-03-11 02:31:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-03-11 02:31:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1384 transitions.
[2021-03-11 02:31:08,324 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877
[2021-03-11 02:31:08,324 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1384 transitions.
[2021-03-11 02:31:08,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1384 transitions.
[2021-03-11 02:31:08,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:08,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1384 transitions.
[2021-03-11 02:31:08,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.5) internal successors, (1384), 16 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,329 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,329 INFO L185 Difference]: Start difference. First operand has 134 places, 118 transitions, 619 flow. Second operand 16 states and 1384 transitions.
[2021-03-11 02:31:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 937 flow
[2021-03-11 02:31:08,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 144 transitions, 753 flow, removed 75 selfloop flow, removed 12 redundant places.
[2021-03-11 02:31:08,338 INFO L241 Difference]: Finished difference. Result has 144 places, 118 transitions, 585 flow
[2021-03-11 02:31:08,339 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=585, PETRI_PLACES=144, PETRI_TRANSITIONS=118}
[2021-03-11 02:31:08,339 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 42 predicate places.
[2021-03-11 02:31:08,339 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 118 transitions, 585 flow
[2021-03-11 02:31:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,339 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:08,339 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:08,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-03-11 02:31:08,339 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1723891726, now seen corresponding path program 1 times
[2021-03-11 02:31:08,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:08,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977818981]
[2021-03-11 02:31:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 02:31:08,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:08,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 02:31:08,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 02:31:08,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 02:31:08,482 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.9 percent of original size
[2021-03-11 02:31:08,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-03-11 02:31:08,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 02:31:08,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26
[2021-03-11 02:31:08,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20
[2021-03-11 02:31:08,535 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.7 percent of original size
[2021-03-11 02:31:08,538 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.9 percent of original size 30
[2021-03-11 02:31:08,558 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.7 percent of original size
[2021-03-11 02:31:08,558 INFO L147 QuantifierPusher]: treesize reduction 9, result has 78.0 percent of original size 32
[2021-03-11 02:31:08,577 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-03-11 02:31:08,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-03-11 02:31:08,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:08,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 02:31:08,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 02:31:08,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 02:31:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 02:31:08,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977818981]
[2021-03-11 02:31:08,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 02:31:08,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-03-11 02:31:08,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723733299]
[2021-03-11 02:31:08,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-03-11 02:31:08,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 02:31:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-03-11 02:31:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2021-03-11 02:31:08,617 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97
[2021-03-11 02:31:08,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 118 transitions, 585 flow. Second operand has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 02:31:08,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97
[2021-03-11 02:31:08,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 02:31:08,913 INFO L129 PetriNetUnfolder]: 175/807 cut-off events.
[2021-03-11 02:31:08,913 INFO L130 PetriNetUnfolder]: For 1643/1701 co-relation queries the response was YES.
[2021-03-11 02:31:08,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 807 events. 175/807 cut-off events. For 1643/1701 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6821 event pairs, 1 based on Foata normal form. 6/774 useless extension candidates. Maximal degree in co-relation 2334. Up to 84 conditions per place.
[2021-03-11 02:31:08,918 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 21 selfloop transitions, 5 changer transitions 9/128 dead transitions.
[2021-03-11 02:31:08,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 128 transitions, 713 flow
[2021-03-11 02:31:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-03-11 02:31:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-03-11 02:31:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 803 transitions.
[2021-03-11 02:31:08,919 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7525773195876289
[2021-03-11 02:31:08,919 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 803 transitions.
[2021-03-11 02:31:08,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 803 transitions.
[2021-03-11 02:31:08,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 02:31:08,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 803 transitions.
[2021-03-11 02:31:08,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.0) internal successors, (803), 11 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,923 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,923 INFO L185 Difference]: Start difference. First operand has 144 places, 118 transitions, 585 flow. Second operand 11 states and 803 transitions.
[2021-03-11 02:31:08,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 128 transitions, 713 flow
[2021-03-11 02:31:08,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 620 flow, removed 22 selfloop flow, removed 14 redundant places.
[2021-03-11 02:31:08,933 INFO L241 Difference]: Finished difference. Result has 142 places, 117 transitions, 532 flow
[2021-03-11 02:31:08,934 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=532, PETRI_PLACES=142, PETRI_TRANSITIONS=117}
[2021-03-11 02:31:08,934 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 40 predicate places.
[2021-03-11 02:31:08,934 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 117 transitions, 532 flow
[2021-03-11 02:31:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 02:31:08,934 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 02:31:08,934 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 02:31:08,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-03-11 02:31:08,934 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 02:31:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 02:31:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1808310402, now seen corresponding path program 2 times
[2021-03-11 02:31:08,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 02:31:08,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393968931]
[2021-03-11 02:31:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 02:31:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 02:31:08,971 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 02:31:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 02:31:09,015 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 02:31:09,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-11 02:31:09,051 INFO L620 BasicCegarLoop]: Counterexample might be feasible
[2021-03-11 02:31:09,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-03-11 02:31:09,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:31:09 BasicIcfg
[2021-03-11 02:31:09,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-11 02:31:09,154 INFO L168 Benchmark]: Toolchain (without parser) took 6894.57 ms. Allocated memory was 255.9 MB in the beginning and 553.6 MB in the end (delta: 297.8 MB). Free memory was 236.7 MB in the beginning and 335.7 MB in the end (delta: -99.0 MB). Peak memory consumption was 198.4 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,154 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.54 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 236.0 MB in the beginning and 331.3 MB in the end (delta: -95.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 371.2 MB. Free memory was 331.3 MB in the beginning and 327.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,155 INFO L168 Benchmark]: Boogie Preprocessor took 21.04 ms. Allocated memory is still 371.2 MB. Free memory was 327.9 MB in the beginning and 325.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,155 INFO L168 Benchmark]: RCFGBuilder took 1365.12 ms. Allocated memory is still 371.2 MB. Free memory was 325.8 MB in the beginning and 226.7 MB in the end (delta: 99.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,155 INFO L168 Benchmark]: TraceAbstraction took 5036.31 ms. Allocated memory was 371.2 MB in the beginning and 553.6 MB in the end (delta: 182.5 MB). Free memory was 226.7 MB in the beginning and 335.7 MB in the end (delta: -109.0 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.0 GB.
[2021-03-11 02:31:09,159 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.70 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 413.54 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 236.0 MB in the beginning and 331.3 MB in the end (delta: -95.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 371.2 MB. Free memory was 331.3 MB in the beginning and 327.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 21.04 ms. Allocated memory is still 371.2 MB. Free memory was 327.9 MB in the beginning and 325.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1365.12 ms. Allocated memory is still 371.2 MB. Free memory was 325.8 MB in the beginning and 226.7 MB in the end (delta: 99.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 5036.31 ms. Allocated memory was 371.2 MB in the beginning and 553.6 MB in the end (delta: 182.5 MB). Free memory was 226.7 MB in the beginning and 335.7 MB in the end (delta: -109.0 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L713] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L714] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L715] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L718] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L719] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L720] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L721] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L722] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L723] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L724] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0]
[L725] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L726] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L727] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L728] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0]
[L729] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L730] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L731] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L732] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L733] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L735] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L736] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L737] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L818] 0 pthread_t t1888;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L820] 0 pthread_t t1889;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L761] 2 x$w_buff1 = x$w_buff0
[L762] 2 x$w_buff0 = 2
[L763] 2 x$w_buff1_used = x$w_buff0_used
[L764] 2 x$w_buff0_used = (_Bool)1
[L18] COND FALSE 2 !(!expression)
[L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L770] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L773] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L822] 0 pthread_t t1890;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L790] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L793] 3 __unbuffered_p2_EBX = y
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L741] 1 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L744] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L836] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L837] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L838] 0 x$flush_delayed = weak$$choice2
[L839] 0 x$mem_tmp = x
[L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L848] 0 x = x$flush_delayed ? x$mem_tmp : x
[L849] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4846.4ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2886.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 53.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 140 SDtfs, 394 SDslu, 494 SDs, 0 SdLazy, 728 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 572.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1238.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=11, InterpolantAutomatonStates: 133, 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: 46.0ms SsaConstructionTime, 457.0ms SatisfiabilityAnalysisTime, 1150.1ms InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 813 ConstructedInterpolants, 0 QuantifiedInterpolants, 3063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...